./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:14:10,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:14:10,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:14:10,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:14:10,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:14:10,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:14:10,243 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:14:10,245 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:14:10,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:14:10,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:14:10,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:14:10,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:14:10,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:14:10,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:14:10,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:14:10,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:14:10,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:14:10,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:14:10,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:14:10,267 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:14:10,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:14:10,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:14:10,271 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:14:10,272 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:14:10,275 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:14:10,275 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:14:10,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:14:10,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:14:10,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:14:10,278 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:14:10,278 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:14:10,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:14:10,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:14:10,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:14:10,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:14:10,282 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:14:10,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:14:10,283 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:14:10,283 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:14:10,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:14:10,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:14:10,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:14:10,310 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:14:10,310 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:14:10,311 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:14:10,311 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:14:10,312 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:14:10,312 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:14:10,313 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:14:10,313 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:14:10,313 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:14:10,313 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:14:10,314 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:14:10,314 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:14:10,314 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:14:10,314 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:14:10,314 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:14:10,314 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:14:10,315 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:14:10,315 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:14:10,315 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:14:10,315 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:14:10,315 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:14:10,315 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:14:10,315 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:14:10,316 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:14:10,316 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:14:10,316 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:10,316 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:14:10,316 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:14:10,316 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:14:10,317 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:14:10,317 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:14:10,317 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:14:10,317 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:14:10,317 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:14:10,317 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:14:10,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:14:10,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:14:10,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:14:10,557 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:14:10,557 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:14:10,558 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:14:11,480 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:14:11,687 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:14:11,688 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:14:11,695 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4387f11a6/497a88a1ea5642bd966dfd47a5157648/FLAGcb5e92daa [2023-08-31 23:14:11,705 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4387f11a6/497a88a1ea5642bd966dfd47a5157648 [2023-08-31 23:14:11,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:14:11,707 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:14:11,708 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:11,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:14:11,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:14:11,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:11" (1/1) ... [2023-08-31 23:14:11,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8e553e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:11, skipping insertion in model container [2023-08-31 23:14:11,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:11" (1/1) ... [2023-08-31 23:14:11,719 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:14:11,754 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:14:11,897 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:14:12,075 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:12,084 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:14:12,101 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:14:12,162 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:12,190 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:12,191 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:12,195 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:14:12,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12 WrapperNode [2023-08-31 23:14:12,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:12,196 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:12,196 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:14:12,196 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:14:12,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,228 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,249 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2023-08-31 23:14:12,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:12,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:14:12,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:14:12,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:14:12,255 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,274 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,277 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,278 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,281 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:14:12,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:14:12,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:14:12,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:14:12,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (1/1) ... [2023-08-31 23:14:12,296 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:12,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:14:12,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:14:12,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:14:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:14:12,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:14:12,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:14:12,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:14:12,344 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:14:12,344 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:14:12,345 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:14:12,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:14:12,345 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:14:12,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:14:12,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:14:12,346 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:14:12,502 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:14:12,503 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:14:12,708 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:14:12,812 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:14:12,812 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:14:12,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:12 BoogieIcfgContainer [2023-08-31 23:14:12,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:14:12,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:14:12,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:14:12,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:14:12,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:14:11" (1/3) ... [2023-08-31 23:14:12,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ab026d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:12, skipping insertion in model container [2023-08-31 23:14:12,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:12" (2/3) ... [2023-08-31 23:14:12,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65ab026d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:12, skipping insertion in model container [2023-08-31 23:14:12,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:12" (3/3) ... [2023-08-31 23:14:12,820 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:14:12,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:14:12,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:14:12,833 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:14:12,883 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:14:12,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:14:12,970 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:14:12,970 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:12,975 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 102 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:14:12,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 142 transitions, 304 flow [2023-08-31 23:14:12,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 138 transitions, 288 flow [2023-08-31 23:14:12,983 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:14:12,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:14:13,001 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 288 flow [2023-08-31 23:14:13,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 288 flow [2023-08-31 23:14:13,038 INFO L130 PetriNetUnfolder]: 2/138 cut-off events. [2023-08-31 23:14:13,039 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:13,040 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 103 event pairs, 0 based on Foata normal form. 0/125 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:14:13,042 INFO L119 LiptonReduction]: Number of co-enabled transitions 3524 [2023-08-31 23:14:17,154 INFO L134 LiptonReduction]: Checked pairs total: 10664 [2023-08-31 23:14:17,154 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-08-31 23:14:17,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:14:17,173 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6feef445, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:14:17,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:14:17,174 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:14:17,174 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:17,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:17,175 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:14:17,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:17,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:17,178 INFO L85 PathProgramCache]: Analyzing trace with hash 599, now seen corresponding path program 1 times [2023-08-31 23:14:17,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:17,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293109615] [2023-08-31 23:14:17,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:17,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:17,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-31 23:14:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293109615] [2023-08-31 23:14:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293109615] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:14:17,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801897808] [2023-08-31 23:14:17,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:17,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:14:17,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:17,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:14:17,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:14:17,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 270 [2023-08-31 23:14:17,275 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-31 23:14:17,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:17,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 270 [2023-08-31 23:14:17,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:18,270 INFO L130 PetriNetUnfolder]: 8719/11826 cut-off events. [2023-08-31 23:14:18,271 INFO L131 PetriNetUnfolder]: For 77/77 co-relation queries the response was YES. [2023-08-31 23:14:18,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23774 conditions, 11826 events. 8719/11826 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 538. Compared 61328 event pairs, 8719 based on Foata normal form. 0/10334 useless extension candidates. Maximal degree in co-relation 23762. Up to 11731 conditions per place. [2023-08-31 23:14:18,318 INFO L137 encePairwiseOnDemand]: 261/270 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:14:18,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-08-31 23:14:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:14:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:14:18,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 291 transitions. [2023-08-31 23:14:18,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5388888888888889 [2023-08-31 23:14:18,327 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 291 transitions. [2023-08-31 23:14:18,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 291 transitions. [2023-08-31 23:14:18,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:18,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 291 transitions. [2023-08-31 23:14:18,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 145.5) internal successors, (291), 2 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,334 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,335 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 291 transitions. [2023-08-31 23:14:18,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-08-31 23:14:18,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:18,339 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:14:18,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, 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-31 23:14:18,343 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:14:18,343 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:14:18,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 127.5) internal successors, (255), 2 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:18,343 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:14:18,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:14:18,344 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:18,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash 587660, now seen corresponding path program 1 times [2023-08-31 23:14:18,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:18,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054486175] [2023-08-31 23:14:18,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:18,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:18,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:18,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:18,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054486175] [2023-08-31 23:14:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054486175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:14:18,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430888971] [2023-08-31 23:14:18,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:18,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:14:18,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:18,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:14:18,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:14:18,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 270 [2023-08-31 23:14:18,508 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:18,508 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:18,508 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 270 [2023-08-31 23:14:18,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:19,279 INFO L130 PetriNetUnfolder]: 6855/9885 cut-off events. [2023-08-31 23:14:19,279 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:19,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19322 conditions, 9885 events. 6855/9885 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 469. Compared 60258 event pairs, 1263 based on Foata normal form. 0/9227 useless extension candidates. Maximal degree in co-relation 19319. Up to 7399 conditions per place. [2023-08-31 23:14:19,313 INFO L137 encePairwiseOnDemand]: 267/270 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-31 23:14:19,313 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-08-31 23:14:19,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:14:19,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:14:19,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-31 23:14:19,316 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.528395061728395 [2023-08-31 23:14:19,316 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-31 23:14:19,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-31 23:14:19,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:19,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-31 23:14:19,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:19,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:19,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:19,319 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 428 transitions. [2023-08-31 23:14:19,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-08-31 23:14:19,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:19,321 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:14:19,321 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, 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=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-31 23:14:19,321 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:14:19,321 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:14:19,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:19,322 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:19,322 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:19,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:14:19,322 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:19,323 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:19,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1898026173, now seen corresponding path program 1 times [2023-08-31 23:14:19,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:19,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258619815] [2023-08-31 23:14:19,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:19,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:19,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-31 23:14:19,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:19,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258619815] [2023-08-31 23:14:19,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258619815] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:19,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:19,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:14:19,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072865217] [2023-08-31 23:14:19,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:19,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:19,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:19,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:19,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:19,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 270 [2023-08-31 23:14:19,536 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:19,536 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:19,536 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 270 [2023-08-31 23:14:19,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:21,964 INFO L130 PetriNetUnfolder]: 29693/39572 cut-off events. [2023-08-31 23:14:21,964 INFO L131 PetriNetUnfolder]: For 1719/1719 co-relation queries the response was YES. [2023-08-31 23:14:22,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81361 conditions, 39572 events. 29693/39572 cut-off events. For 1719/1719 co-relation queries the response was YES. Maximal size of possible extension queue 1227. Compared 214071 event pairs, 7406 based on Foata normal form. 0/38238 useless extension candidates. Maximal degree in co-relation 81357. Up to 16320 conditions per place. [2023-08-31 23:14:22,157 INFO L137 encePairwiseOnDemand]: 259/270 looper letters, 74 selfloop transitions, 18 changer transitions 0/92 dead transitions. [2023-08-31 23:14:22,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 92 transitions, 390 flow [2023-08-31 23:14:22,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-08-31 23:14:22,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4955555555555556 [2023-08-31 23:14:22,160 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-08-31 23:14:22,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-08-31 23:14:22,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:22,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-08-31 23:14:22,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,164 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 669 transitions. [2023-08-31 23:14:22,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 92 transitions, 390 flow [2023-08-31 23:14:22,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 92 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:22,166 INFO L231 Difference]: Finished difference. Result has 48 places, 47 transitions, 212 flow [2023-08-31 23:14:22,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=48, PETRI_TRANSITIONS=47} [2023-08-31 23:14:22,167 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-31 23:14:22,169 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 47 transitions, 212 flow [2023-08-31 23:14:22,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:22,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:22,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:14:22,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:22,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1290730776, now seen corresponding path program 1 times [2023-08-31 23:14:22,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:22,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707149975] [2023-08-31 23:14:22,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:22,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:22,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:22,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:22,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707149975] [2023-08-31 23:14:22,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707149975] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:22,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:22,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:22,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894207383] [2023-08-31 23:14:22,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:22,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:22,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:22,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:22,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:22,690 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 270 [2023-08-31 23:14:22,691 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 47 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:22,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:22,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 270 [2023-08-31 23:14:22,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:24,841 INFO L130 PetriNetUnfolder]: 19093/26596 cut-off events. [2023-08-31 23:14:24,842 INFO L131 PetriNetUnfolder]: For 23295/24610 co-relation queries the response was YES. [2023-08-31 23:14:24,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69579 conditions, 26596 events. 19093/26596 cut-off events. For 23295/24610 co-relation queries the response was YES. Maximal size of possible extension queue 1242. Compared 161362 event pairs, 8018 based on Foata normal form. 2737/28067 useless extension candidates. Maximal degree in co-relation 69572. Up to 24392 conditions per place. [2023-08-31 23:14:24,986 INFO L137 encePairwiseOnDemand]: 265/270 looper letters, 47 selfloop transitions, 4 changer transitions 1/64 dead transitions. [2023-08-31 23:14:24,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 358 flow [2023-08-31 23:14:24,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:24,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-31 23:14:24,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4271604938271605 [2023-08-31 23:14:24,989 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-31 23:14:24,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-31 23:14:24,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:24,989 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-31 23:14:24,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,994 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:24,994 INFO L175 Difference]: Start difference. First operand has 48 places, 47 transitions, 212 flow. Second operand 6 states and 692 transitions. [2023-08-31 23:14:24,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 358 flow [2023-08-31 23:14:25,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:14:25,002 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 196 flow [2023-08-31 23:14:25,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=196, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-08-31 23:14:25,003 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:14:25,003 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 196 flow [2023-08-31 23:14:25,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:25,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:25,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:14:25,004 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:25,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1003409119, now seen corresponding path program 1 times [2023-08-31 23:14:25,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:25,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768572311] [2023-08-31 23:14:25,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:25,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:25,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:25,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768572311] [2023-08-31 23:14:25,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768572311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:25,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:25,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:25,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258567561] [2023-08-31 23:14:25,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:25,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:25,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:25,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:25,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:25,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 270 [2023-08-31 23:14:25,238 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 196 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:25,238 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:25,238 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 270 [2023-08-31 23:14:25,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:27,478 INFO L130 PetriNetUnfolder]: 24448/33457 cut-off events. [2023-08-31 23:14:27,479 INFO L131 PetriNetUnfolder]: For 26806/26806 co-relation queries the response was YES. [2023-08-31 23:14:27,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92864 conditions, 33457 events. 24448/33457 cut-off events. For 26806/26806 co-relation queries the response was YES. Maximal size of possible extension queue 1099. Compared 185523 event pairs, 4383 based on Foata normal form. 1302/34759 useless extension candidates. Maximal degree in co-relation 92856. Up to 11177 conditions per place. [2023-08-31 23:14:27,648 INFO L137 encePairwiseOnDemand]: 260/270 looper letters, 58 selfloop transitions, 9 changer transitions 64/131 dead transitions. [2023-08-31 23:14:27,649 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 131 transitions, 800 flow [2023-08-31 23:14:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:27,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 915 transitions. [2023-08-31 23:14:27,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48412698412698413 [2023-08-31 23:14:27,651 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 915 transitions. [2023-08-31 23:14:27,651 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 915 transitions. [2023-08-31 23:14:27,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:27,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 915 transitions. [2023-08-31 23:14:27,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 130.71428571428572) internal successors, (915), 7 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,657 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,657 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 196 flow. Second operand 7 states and 915 transitions. [2023-08-31 23:14:27,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 131 transitions, 800 flow [2023-08-31 23:14:27,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 131 transitions, 793 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:27,668 INFO L231 Difference]: Finished difference. Result has 60 places, 41 transitions, 241 flow [2023-08-31 23:14:27,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=241, PETRI_PLACES=60, PETRI_TRANSITIONS=41} [2023-08-31 23:14:27,669 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2023-08-31 23:14:27,669 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 41 transitions, 241 flow [2023-08-31 23:14:27,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:27,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:27,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:27,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:14:27,670 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:27,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1974808138, now seen corresponding path program 1 times [2023-08-31 23:14:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:27,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799126511] [2023-08-31 23:14:27,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:27,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:27,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799126511] [2023-08-31 23:14:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799126511] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258446875] [2023-08-31 23:14:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:27,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:27,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 270 [2023-08-31 23:14:27,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 41 transitions, 241 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-31 23:14:27,824 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:27,824 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 270 [2023-08-31 23:14:27,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:29,750 INFO L130 PetriNetUnfolder]: 19260/26325 cut-off events. [2023-08-31 23:14:29,751 INFO L131 PetriNetUnfolder]: For 62441/62441 co-relation queries the response was YES. [2023-08-31 23:14:29,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83881 conditions, 26325 events. 19260/26325 cut-off events. For 62441/62441 co-relation queries the response was YES. Maximal size of possible extension queue 792. Compared 144557 event pairs, 3797 based on Foata normal form. 902/27227 useless extension candidates. Maximal degree in co-relation 83868. Up to 13214 conditions per place. [2023-08-31 23:14:29,861 INFO L137 encePairwiseOnDemand]: 260/270 looper letters, 65 selfloop transitions, 18 changer transitions 41/124 dead transitions. [2023-08-31 23:14:29,861 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 124 transitions, 845 flow [2023-08-31 23:14:29,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:29,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:29,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 922 transitions. [2023-08-31 23:14:29,863 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48783068783068784 [2023-08-31 23:14:29,863 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 922 transitions. [2023-08-31 23:14:29,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 922 transitions. [2023-08-31 23:14:29,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:29,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 922 transitions. [2023-08-31 23:14:29,865 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.71428571428572) internal successors, (922), 7 states have internal predecessors, (922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,867 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,867 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:29,868 INFO L175 Difference]: Start difference. First operand has 60 places, 41 transitions, 241 flow. Second operand 7 states and 922 transitions. [2023-08-31 23:14:29,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 124 transitions, 845 flow [2023-08-31 23:14:29,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 124 transitions, 778 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:29,946 INFO L231 Difference]: Finished difference. Result has 62 places, 48 transitions, 332 flow [2023-08-31 23:14:29,946 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=332, PETRI_PLACES=62, PETRI_TRANSITIONS=48} [2023-08-31 23:14:29,946 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 9 predicate places. [2023-08-31 23:14:29,946 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 48 transitions, 332 flow [2023-08-31 23:14:29,947 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-31 23:14:29,947 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:29,947 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:29,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 23:14:29,947 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:29,947 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:29,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1087552530, now seen corresponding path program 1 times [2023-08-31 23:14:29,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:29,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158349042] [2023-08-31 23:14:29,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:29,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:29,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:30,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:30,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:30,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158349042] [2023-08-31 23:14:30,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158349042] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:30,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:30,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 23:14:30,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883377586] [2023-08-31 23:14:30,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:30,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:30,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:30,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:30,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:30,062 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 270 [2023-08-31 23:14:30,063 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 48 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:30,063 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:30,063 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 270 [2023-08-31 23:14:30,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:31,522 INFO L130 PetriNetUnfolder]: 15540/22041 cut-off events. [2023-08-31 23:14:31,523 INFO L131 PetriNetUnfolder]: For 56902/57587 co-relation queries the response was YES. [2023-08-31 23:14:31,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69565 conditions, 22041 events. 15540/22041 cut-off events. For 56902/57587 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 130402 event pairs, 4736 based on Foata normal form. 1073/22791 useless extension candidates. Maximal degree in co-relation 69548. Up to 17778 conditions per place. [2023-08-31 23:14:31,657 INFO L137 encePairwiseOnDemand]: 265/270 looper letters, 52 selfloop transitions, 8 changer transitions 29/101 dead transitions. [2023-08-31 23:14:31,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 101 transitions, 811 flow [2023-08-31 23:14:31,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 682 transitions. [2023-08-31 23:14:31,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5051851851851852 [2023-08-31 23:14:31,659 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 682 transitions. [2023-08-31 23:14:31,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 682 transitions. [2023-08-31 23:14:31,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:31,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 682 transitions. [2023-08-31 23:14:31,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.4) internal successors, (682), 5 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,662 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,662 INFO L175 Difference]: Start difference. First operand has 62 places, 48 transitions, 332 flow. Second operand 5 states and 682 transitions. [2023-08-31 23:14:31,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 101 transitions, 811 flow [2023-08-31 23:14:31,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 101 transitions, 773 flow, removed 19 selfloop flow, removed 5 redundant places. [2023-08-31 23:14:31,881 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 408 flow [2023-08-31 23:14:31,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-08-31 23:14:31,882 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 8 predicate places. [2023-08-31 23:14:31,882 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 408 flow [2023-08-31 23:14:31,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.5) internal successors, (506), 4 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:31,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:31,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:31,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 23:14:31,883 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:31,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:31,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1531917573, now seen corresponding path program 1 times [2023-08-31 23:14:31,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:31,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517228639] [2023-08-31 23:14:31,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:31,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:32,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517228639] [2023-08-31 23:14:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517228639] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943178098] [2023-08-31 23:14:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:32,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:32,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:32,013 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 270 [2023-08-31 23:14:32,014 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 408 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:32,014 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:32,014 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 270 [2023-08-31 23:14:32,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:33,985 INFO L130 PetriNetUnfolder]: 20401/28830 cut-off events. [2023-08-31 23:14:33,985 INFO L131 PetriNetUnfolder]: For 63149/64236 co-relation queries the response was YES. [2023-08-31 23:14:34,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88033 conditions, 28830 events. 20401/28830 cut-off events. For 63149/64236 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 178154 event pairs, 7774 based on Foata normal form. 1082/29078 useless extension candidates. Maximal degree in co-relation 88017. Up to 13492 conditions per place. [2023-08-31 23:14:34,163 INFO L137 encePairwiseOnDemand]: 266/270 looper letters, 52 selfloop transitions, 8 changer transitions 26/98 dead transitions. [2023-08-31 23:14:34,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 98 transitions, 749 flow [2023-08-31 23:14:34,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:34,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:34,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-31 23:14:34,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2023-08-31 23:14:34,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-31 23:14:34,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-31 23:14:34,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:34,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-31 23:14:34,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,168 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,168 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 408 flow. Second operand 5 states and 684 transitions. [2023-08-31 23:14:34,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 98 transitions, 749 flow [2023-08-31 23:14:34,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 98 transitions, 727 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:34,224 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 411 flow [2023-08-31 23:14:34,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=392, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=411, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-08-31 23:14:34,224 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 11 predicate places. [2023-08-31 23:14:34,225 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 411 flow [2023-08-31 23:14:34,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:34,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:34,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 23:14:34,225 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:34,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:34,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1479059316, now seen corresponding path program 1 times [2023-08-31 23:14:34,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:34,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480513474] [2023-08-31 23:14:34,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:34,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:34,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:34,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:34,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:34,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480513474] [2023-08-31 23:14:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480513474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:34,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:14:34,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902790646] [2023-08-31 23:14:34,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:34,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:14:34,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:34,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:14:34,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:14:34,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-31 23:14:34,344 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:34,344 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:34,344 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-31 23:14:34,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:35,804 INFO L130 PetriNetUnfolder]: 13441/19915 cut-off events. [2023-08-31 23:14:35,804 INFO L131 PetriNetUnfolder]: For 38882/40219 co-relation queries the response was YES. [2023-08-31 23:14:35,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58882 conditions, 19915 events. 13441/19915 cut-off events. For 38882/40219 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 130737 event pairs, 2622 based on Foata normal form. 1945/21513 useless extension candidates. Maximal degree in co-relation 58864. Up to 13055 conditions per place. [2023-08-31 23:14:35,880 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 101 selfloop transitions, 10 changer transitions 0/128 dead transitions. [2023-08-31 23:14:35,880 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 128 transitions, 1114 flow [2023-08-31 23:14:35,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:14:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:14:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 678 transitions. [2023-08-31 23:14:35,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022222222222222 [2023-08-31 23:14:35,882 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 678 transitions. [2023-08-31 23:14:35,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 678 transitions. [2023-08-31 23:14:35,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:35,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 678 transitions. [2023-08-31 23:14:35,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.6) internal successors, (678), 5 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,885 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 411 flow. Second operand 5 states and 678 transitions. [2023-08-31 23:14:35,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 128 transitions, 1114 flow [2023-08-31 23:14:35,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 128 transitions, 1069 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:35,903 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 468 flow [2023-08-31 23:14:35,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=468, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2023-08-31 23:14:35,904 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2023-08-31 23:14:35,904 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 468 flow [2023-08-31 23:14:35,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.75) internal successors, (499), 4 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:35,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:35,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:35,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 23:14:35,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:35,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:35,905 INFO L85 PathProgramCache]: Analyzing trace with hash -232621276, now seen corresponding path program 1 times [2023-08-31 23:14:35,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:35,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818704065] [2023-08-31 23:14:35,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:35,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:36,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:36,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:36,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818704065] [2023-08-31 23:14:36,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818704065] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:36,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:36,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746563546] [2023-08-31 23:14:36,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:36,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:36,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 270 [2023-08-31 23:14:36,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 468 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:36,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:36,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 270 [2023-08-31 23:14:36,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:38,813 INFO L130 PetriNetUnfolder]: 24625/35534 cut-off events. [2023-08-31 23:14:38,813 INFO L131 PetriNetUnfolder]: For 95367/95367 co-relation queries the response was YES. [2023-08-31 23:14:38,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136373 conditions, 35534 events. 24625/35534 cut-off events. For 95367/95367 co-relation queries the response was YES. Maximal size of possible extension queue 1226. Compared 227838 event pairs, 6617 based on Foata normal form. 528/36062 useless extension candidates. Maximal degree in co-relation 136354. Up to 17717 conditions per place. [2023-08-31 23:14:38,927 INFO L137 encePairwiseOnDemand]: 260/270 looper letters, 84 selfloop transitions, 20 changer transitions 59/163 dead transitions. [2023-08-31 23:14:38,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 163 transitions, 1375 flow [2023-08-31 23:14:38,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:38,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 918 transitions. [2023-08-31 23:14:38,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-31 23:14:38,929 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 918 transitions. [2023-08-31 23:14:38,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 918 transitions. [2023-08-31 23:14:38,929 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:38,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 918 transitions. [2023-08-31 23:14:38,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.14285714285714) internal successors, (918), 7 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,933 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:38,933 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 468 flow. Second operand 7 states and 918 transitions. [2023-08-31 23:14:38,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 163 transitions, 1375 flow [2023-08-31 23:14:39,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 163 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:14:39,009 INFO L231 Difference]: Finished difference. Result has 77 places, 59 transitions, 567 flow [2023-08-31 23:14:39,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=567, PETRI_PLACES=77, PETRI_TRANSITIONS=59} [2023-08-31 23:14:39,009 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-31 23:14:39,010 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 59 transitions, 567 flow [2023-08-31 23:14:39,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:39,010 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:39,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 23:14:39,010 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:39,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1472290199, now seen corresponding path program 1 times [2023-08-31 23:14:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:39,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857161313] [2023-08-31 23:14:39,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:39,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:39,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:39,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:39,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857161313] [2023-08-31 23:14:39,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857161313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:39,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:39,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:39,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787584320] [2023-08-31 23:14:39,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:39,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:39,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:39,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:39,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:39,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-31 23:14:39,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 59 transitions, 567 flow. Second operand has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:39,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:39,140 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-31 23:14:39,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:40,218 INFO L130 PetriNetUnfolder]: 8140/12781 cut-off events. [2023-08-31 23:14:40,218 INFO L131 PetriNetUnfolder]: For 36916/37585 co-relation queries the response was YES. [2023-08-31 23:14:40,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46785 conditions, 12781 events. 8140/12781 cut-off events. For 36916/37585 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 85855 event pairs, 1214 based on Foata normal form. 1461/14038 useless extension candidates. Maximal degree in co-relation 46761. Up to 4918 conditions per place. [2023-08-31 23:14:40,279 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 123 selfloop transitions, 14 changer transitions 1/156 dead transitions. [2023-08-31 23:14:40,279 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 156 transitions, 1605 flow [2023-08-31 23:14:40,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:14:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:14:40,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2023-08-31 23:14:40,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2023-08-31 23:14:40,281 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2023-08-31 23:14:40,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2023-08-31 23:14:40,282 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:40,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2023-08-31 23:14:40,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 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-31 23:14:40,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,285 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,285 INFO L175 Difference]: Start difference. First operand has 77 places, 59 transitions, 567 flow. Second operand 6 states and 816 transitions. [2023-08-31 23:14:40,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 156 transitions, 1605 flow [2023-08-31 23:14:40,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 156 transitions, 1583 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-31 23:14:40,385 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 673 flow [2023-08-31 23:14:40,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=553, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=673, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2023-08-31 23:14:40,386 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-31 23:14:40,386 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 673 flow [2023-08-31 23:14:40,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 124.4) internal successors, (622), 5 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:40,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:40,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-31 23:14:40,386 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:40,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:40,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1157084204, now seen corresponding path program 1 times [2023-08-31 23:14:40,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:40,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559531078] [2023-08-31 23:14:40,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:40,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:40,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:40,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559531078] [2023-08-31 23:14:40,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559531078] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:40,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:40,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:14:40,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303178579] [2023-08-31 23:14:40,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:40,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:14:40,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:40,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:14:40,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:14:40,530 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 270 [2023-08-31 23:14:40,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:40,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:40,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 270 [2023-08-31 23:14:40,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:42,455 INFO L130 PetriNetUnfolder]: 13561/20708 cut-off events. [2023-08-31 23:14:42,455 INFO L131 PetriNetUnfolder]: For 104623/104623 co-relation queries the response was YES. [2023-08-31 23:14:42,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94793 conditions, 20708 events. 13561/20708 cut-off events. For 104623/104623 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 137673 event pairs, 1435 based on Foata normal form. 180/20888 useless extension candidates. Maximal degree in co-relation 94768. Up to 10646 conditions per place. [2023-08-31 23:14:42,524 INFO L137 encePairwiseOnDemand]: 259/270 looper letters, 100 selfloop transitions, 35 changer transitions 49/184 dead transitions. [2023-08-31 23:14:42,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 184 transitions, 2010 flow [2023-08-31 23:14:42,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:42,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 897 transitions. [2023-08-31 23:14:42,527 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4746031746031746 [2023-08-31 23:14:42,527 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 897 transitions. [2023-08-31 23:14:42,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 897 transitions. [2023-08-31 23:14:42,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:42,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 897 transitions. [2023-08-31 23:14:42,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:42,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:42,530 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:42,531 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 673 flow. Second operand 7 states and 897 transitions. [2023-08-31 23:14:42,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 184 transitions, 2010 flow [2023-08-31 23:14:43,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 184 transitions, 1860 flow, removed 60 selfloop flow, removed 2 redundant places. [2023-08-31 23:14:43,211 INFO L231 Difference]: Finished difference. Result has 86 places, 80 transitions, 956 flow [2023-08-31 23:14:43,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=629, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=956, PETRI_PLACES=86, PETRI_TRANSITIONS=80} [2023-08-31 23:14:43,212 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2023-08-31 23:14:43,212 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 80 transitions, 956 flow [2023-08-31 23:14:43,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:43,212 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:43,212 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:43,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-31 23:14:43,212 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:43,213 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:43,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1387423934, now seen corresponding path program 2 times [2023-08-31 23:14:43,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:43,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283619810] [2023-08-31 23:14:43,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:43,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:43,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:43,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:43,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:43,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283619810] [2023-08-31 23:14:43,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283619810] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:43,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:43,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:14:43,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129152952] [2023-08-31 23:14:43,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:43,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:14:43,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:43,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:14:43,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:14:43,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-31 23:14:43,367 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 80 transitions, 956 flow. Second operand has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:43,367 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:43,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-31 23:14:43,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:44,302 INFO L130 PetriNetUnfolder]: 5859/9522 cut-off events. [2023-08-31 23:14:44,302 INFO L131 PetriNetUnfolder]: For 39483/39969 co-relation queries the response was YES. [2023-08-31 23:14:44,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39137 conditions, 9522 events. 5859/9522 cut-off events. For 39483/39969 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 64506 event pairs, 883 based on Foata normal form. 805/10183 useless extension candidates. Maximal degree in co-relation 39107. Up to 2965 conditions per place. [2023-08-31 23:14:44,346 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 132 selfloop transitions, 18 changer transitions 34/209 dead transitions. [2023-08-31 23:14:44,346 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 209 transitions, 2626 flow [2023-08-31 23:14:44,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:14:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:14:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 952 transitions. [2023-08-31 23:14:44,348 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2023-08-31 23:14:44,348 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 952 transitions. [2023-08-31 23:14:44,348 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 952 transitions. [2023-08-31 23:14:44,348 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:44,348 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 952 transitions. [2023-08-31 23:14:44,349 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 136.0) internal successors, (952), 7 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:44,351 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:44,351 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:44,352 INFO L175 Difference]: Start difference. First operand has 86 places, 80 transitions, 956 flow. Second operand 7 states and 952 transitions. [2023-08-31 23:14:44,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 209 transitions, 2626 flow [2023-08-31 23:14:44,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 209 transitions, 2478 flow, removed 41 selfloop flow, removed 4 redundant places. [2023-08-31 23:14:44,400 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 1006 flow [2023-08-31 23:14:44,400 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1006, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2023-08-31 23:14:44,401 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2023-08-31 23:14:44,401 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 1006 flow [2023-08-31 23:14:44,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.16666666666667) internal successors, (745), 6 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:44,401 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:44,401 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] [2023-08-31 23:14:44,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 23:14:44,401 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:44,402 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:44,402 INFO L85 PathProgramCache]: Analyzing trace with hash 932774196, now seen corresponding path program 1 times [2023-08-31 23:14:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:44,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217846441] [2023-08-31 23:14:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:44,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:44,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:44,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217846441] [2023-08-31 23:14:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217846441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:44,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:14:44,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985998145] [2023-08-31 23:14:44,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:44,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:14:44,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:44,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:14:44,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:14:44,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-31 23:14:44,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 1006 flow. Second operand has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:44,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:44,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-31 23:14:44,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:45,519 INFO L130 PetriNetUnfolder]: 5639/9139 cut-off events. [2023-08-31 23:14:45,519 INFO L131 PetriNetUnfolder]: For 34894/35348 co-relation queries the response was YES. [2023-08-31 23:14:45,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40544 conditions, 9139 events. 5639/9139 cut-off events. For 34894/35348 co-relation queries the response was YES. Maximal size of possible extension queue 482. Compared 61796 event pairs, 851 based on Foata normal form. 297/9292 useless extension candidates. Maximal degree in co-relation 40513. Up to 2953 conditions per place. [2023-08-31 23:14:45,558 INFO L137 encePairwiseOnDemand]: 263/270 looper letters, 82 selfloop transitions, 22 changer transitions 89/205 dead transitions. [2023-08-31 23:14:45,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 205 transitions, 2492 flow [2023-08-31 23:14:45,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 23:14:45,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 23:14:45,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1195 transitions. [2023-08-31 23:14:45,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49176954732510286 [2023-08-31 23:14:45,560 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1195 transitions. [2023-08-31 23:14:45,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1195 transitions. [2023-08-31 23:14:45,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:45,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1195 transitions. [2023-08-31 23:14:45,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 132.77777777777777) internal successors, (1195), 9 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:45,564 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:45,565 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:45,565 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 1006 flow. Second operand 9 states and 1195 transitions. [2023-08-31 23:14:45,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 205 transitions, 2492 flow [2023-08-31 23:14:46,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 205 transitions, 2289 flow, removed 56 selfloop flow, removed 8 redundant places. [2023-08-31 23:14:46,208 INFO L231 Difference]: Finished difference. Result has 90 places, 62 transitions, 590 flow [2023-08-31 23:14:46,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=870, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=590, PETRI_PLACES=90, PETRI_TRANSITIONS=62} [2023-08-31 23:14:46,208 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 37 predicate places. [2023-08-31 23:14:46,208 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 62 transitions, 590 flow [2023-08-31 23:14:46,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:46,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:46,209 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, 1] [2023-08-31 23:14:46,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 23:14:46,209 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:46,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:46,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1506630964, now seen corresponding path program 1 times [2023-08-31 23:14:46,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:46,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715984348] [2023-08-31 23:14:46,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:46,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:46,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:47,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:47,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715984348] [2023-08-31 23:14:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715984348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:14:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477919139] [2023-08-31 23:14:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:47,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:14:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:47,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:14:47,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:14:47,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-31 23:14:47,198 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 62 transitions, 590 flow. Second operand has 9 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:47,198 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:47,198 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-31 23:14:47,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:47,697 INFO L130 PetriNetUnfolder]: 1686/2839 cut-off events. [2023-08-31 23:14:47,697 INFO L131 PetriNetUnfolder]: For 8860/9059 co-relation queries the response was YES. [2023-08-31 23:14:47,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12382 conditions, 2839 events. 1686/2839 cut-off events. For 8860/9059 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16161 event pairs, 182 based on Foata normal form. 79/2890 useless extension candidates. Maximal degree in co-relation 12352. Up to 1139 conditions per place. [2023-08-31 23:14:47,710 INFO L137 encePairwiseOnDemand]: 262/270 looper letters, 101 selfloop transitions, 5 changer transitions 41/159 dead transitions. [2023-08-31 23:14:47,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 159 transitions, 1654 flow [2023-08-31 23:14:47,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:14:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:14:47,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1045 transitions. [2023-08-31 23:14:47,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4837962962962963 [2023-08-31 23:14:47,713 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1045 transitions. [2023-08-31 23:14:47,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1045 transitions. [2023-08-31 23:14:47,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:47,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1045 transitions. [2023-08-31 23:14:47,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 130.625) internal successors, (1045), 8 states have internal predecessors, (1045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:47,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 270.0) internal successors, (2430), 9 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:47,717 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 270.0) internal successors, (2430), 9 states have internal predecessors, (2430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:47,717 INFO L175 Difference]: Start difference. First operand has 90 places, 62 transitions, 590 flow. Second operand 8 states and 1045 transitions. [2023-08-31 23:14:47,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 159 transitions, 1654 flow [2023-08-31 23:14:47,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 159 transitions, 1295 flow, removed 85 selfloop flow, removed 18 redundant places. [2023-08-31 23:14:47,753 INFO L231 Difference]: Finished difference. Result has 83 places, 65 transitions, 486 flow [2023-08-31 23:14:47,753 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=486, PETRI_PLACES=83, PETRI_TRANSITIONS=65} [2023-08-31 23:14:47,754 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2023-08-31 23:14:47,754 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 65 transitions, 486 flow [2023-08-31 23:14:47,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:47,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:47,755 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, 1] [2023-08-31 23:14:47,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 23:14:47,755 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:47,755 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:47,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1234983040, now seen corresponding path program 2 times [2023-08-31 23:14:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693537724] [2023-08-31 23:14:47,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:47,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:47,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:48,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-31 23:14:48,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:14:48,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693537724] [2023-08-31 23:14:48,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693537724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:48,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:48,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:14:48,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615077721] [2023-08-31 23:14:48,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:48,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:14:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:14:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:14:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:14:48,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 270 [2023-08-31 23:14:48,712 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 65 transitions, 486 flow. Second operand has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:48,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:48,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 270 [2023-08-31 23:14:48,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:14:49,430 INFO L130 PetriNetUnfolder]: 2124/3475 cut-off events. [2023-08-31 23:14:49,431 INFO L131 PetriNetUnfolder]: For 8199/8230 co-relation queries the response was YES. [2023-08-31 23:14:49,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13678 conditions, 3475 events. 2124/3475 cut-off events. For 8199/8230 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 18495 event pairs, 522 based on Foata normal form. 32/3501 useless extension candidates. Maximal degree in co-relation 13654. Up to 2527 conditions per place. [2023-08-31 23:14:49,444 INFO L137 encePairwiseOnDemand]: 259/270 looper letters, 86 selfloop transitions, 20 changer transitions 81/192 dead transitions. [2023-08-31 23:14:49,444 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 192 transitions, 1677 flow [2023-08-31 23:14:49,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 23:14:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 23:14:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1519 transitions. [2023-08-31 23:14:49,447 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46882716049382717 [2023-08-31 23:14:49,447 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1519 transitions. [2023-08-31 23:14:49,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1519 transitions. [2023-08-31 23:14:49,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:14:49,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1519 transitions. [2023-08-31 23:14:49,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 126.58333333333333) internal successors, (1519), 12 states have internal predecessors, (1519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:49,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 270.0) internal successors, (3510), 13 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:49,454 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 270.0) internal successors, (3510), 13 states have internal predecessors, (3510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:49,454 INFO L175 Difference]: Start difference. First operand has 83 places, 65 transitions, 486 flow. Second operand 12 states and 1519 transitions. [2023-08-31 23:14:49,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 192 transitions, 1677 flow [2023-08-31 23:14:49,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 192 transitions, 1655 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-31 23:14:49,488 INFO L231 Difference]: Finished difference. Result has 92 places, 72 transitions, 614 flow [2023-08-31 23:14:49,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=614, PETRI_PLACES=92, PETRI_TRANSITIONS=72} [2023-08-31 23:14:49,489 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 39 predicate places. [2023-08-31 23:14:49,489 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 72 transitions, 614 flow [2023-08-31 23:14:49,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.0) internal successors, (1080), 9 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:14:49,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:49,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:49,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-31 23:14:49,490 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:49,490 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:49,491 INFO L85 PathProgramCache]: Analyzing trace with hash -627901814, now seen corresponding path program 3 times [2023-08-31 23:14:49,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:14:49,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456446880] [2023-08-31 23:14:49,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:49,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:14:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:49,546 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:14:49,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:14:49,621 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:14:49,621 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:14:49,622 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:14:49,623 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:14:49,624 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:14:49,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:14:49,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:14:49,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:14:49,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:14:49,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:14:49,625 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:14:49,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-31 23:14:49,626 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:14:49,629 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:14:49,629 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:14:49,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:14:49 BasicIcfg [2023-08-31 23:14:49,686 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:14:49,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:14:49,687 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:14:49,687 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:14:49,687 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:12" (3/4) ... [2023-08-31 23:14:49,689 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:14:49,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:14:49,689 INFO L158 Benchmark]: Toolchain (without parser) took 37982.10ms. Allocated memory was 79.7MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 56.2MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-08-31 23:14:49,698 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:49,698 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.42ms. Allocated memory is still 79.7MB. Free memory was 56.0MB in the beginning and 50.5MB in the end (delta: 5.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-31 23:14:49,698 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.11ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 47.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:49,698 INFO L158 Benchmark]: Boogie Preprocessor took 31.85ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:14:49,699 INFO L158 Benchmark]: RCFGBuilder took 527.35ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 64.1MB in the end (delta: -18.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2023-08-31 23:14:49,699 INFO L158 Benchmark]: TraceAbstraction took 36870.55ms. Allocated memory was 96.5MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 63.6MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2023-08-31 23:14:49,699 INFO L158 Benchmark]: Witness Printer took 2.30ms. Allocated memory is still 7.3GB. Free memory is still 5.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:14:49,700 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.14ms. Allocated memory is still 56.6MB. Free memory was 34.4MB in the beginning and 34.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.42ms. Allocated memory is still 79.7MB. Free memory was 56.0MB in the beginning and 50.5MB in the end (delta: 5.6MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.11ms. Allocated memory is still 79.7MB. Free memory was 50.5MB in the beginning and 47.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.85ms. Allocated memory is still 79.7MB. Free memory was 47.8MB in the beginning and 45.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.35ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 45.7MB in the beginning and 64.1MB in the end (delta: -18.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36870.55ms. Allocated memory was 96.5MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 63.6MB in the beginning and 5.3GB in the end (delta: -5.2GB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 2.30ms. Allocated memory is still 7.3GB. Free memory is still 5.3GB. 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.2s, 149 PlacesBefore, 53 PlacesAfterwards, 138 TransitionsBefore, 41 TransitionsAfterwards, 3524 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 128 TotalNumberOfCompositions, 10664 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5036, independent: 4792, independent conditional: 0, independent unconditional: 4792, dependent: 244, dependent conditional: 0, dependent unconditional: 244, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1848, independent: 1806, independent conditional: 0, independent unconditional: 1806, dependent: 42, dependent conditional: 0, dependent unconditional: 42, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5036, independent: 2986, independent conditional: 0, independent unconditional: 2986, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 1848, unknown conditional: 0, unknown unconditional: 1848] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 191, Positive conditional cache size: 0, Positive unconditional cache size: 191, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=-1, t553={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=0, t553={5:0}, t554={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L868] 0 pthread_t t555; [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=1, t553={5:0}, t554={6:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=2, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=0, z=0] [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=2, z=1] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=2, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t553={5:0}, t554={6:0}, t555={7:0}, t556={3:0}, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] - 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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 865]: 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: 869]: 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: 871]: 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, 179 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: 36.7s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1246 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1040 mSDsluCounter, 870 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 774 mSDsCounter, 148 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3258 IncrementalHoareTripleChecker+Invalid, 3406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 148 mSolverCounterUnsat, 96 mSDtfsCounter, 3258 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1006occurred in iteration=13, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 2553 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:14:49,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:14:51,541 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:14:51,543 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:14:51,562 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:14:51,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:14:51,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:14:51,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:14:51,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:14:51,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:14:51,567 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:14:51,568 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:14:51,568 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:14:51,569 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:14:51,569 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:14:51,570 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:14:51,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:14:51,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:14:51,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:14:51,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:14:51,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:14:51,575 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:14:51,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:14:51,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:14:51,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:14:51,596 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:14:51,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:14:51,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:14:51,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:14:51,604 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:14:51,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:14:51,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:14:51,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:14:51,608 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:14:51,609 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:14:51,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:14:51,610 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:14:51,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:14:51,611 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:14:51,611 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:14:51,612 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:14:51,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:14:51,613 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:14:51,642 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:14:51,643 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:14:51,644 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:14:51,644 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:14:51,644 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:14:51,645 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:14:51,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:14:51,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:14:51,646 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:14:51,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:14:51,647 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:14:51,648 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:14:51,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:14:51,648 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:14:51,648 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:14:51,648 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:14:51,648 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:14:51,649 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:14:51,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:14:51,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:14:51,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:14:51,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:51,649 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:14:51,649 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:14:51,650 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:14:51,650 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:14:51,650 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:14:51,650 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:14:51,650 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:14:51,650 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:14:51,651 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:14:51,651 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 -> 8943650a21e052edc6a6af145da55799620df509a78c8e503eca6167eaa2f8fc Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:14:51,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:14:51,912 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:14:51,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:14:51,915 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:14:51,915 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:14:51,916 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:14:52,858 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:14:53,103 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:14:53,105 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:14:53,118 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5a837e4/8a8fda5ac7654f9f9cff072bf3f91a50/FLAG71dd9750a [2023-08-31 23:14:53,134 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf5a837e4/8a8fda5ac7654f9f9cff072bf3f91a50 [2023-08-31 23:14:53,136 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:14:53,137 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:14:53,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:53,138 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:14:53,140 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:14:53,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@996c112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53, skipping insertion in model container [2023-08-31 23:14:53,143 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,148 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:14:53,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:14:53,318 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:14:53,457 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:53,476 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:14:53,483 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/mix021_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2023-08-31 23:14:53,516 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:14:53,537 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:53,538 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:14:53,542 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:14:53,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53 WrapperNode [2023-08-31 23:14:53,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:14:53,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:53,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:14:53,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:14:53,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,569 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,585 INFO L138 Inliner]: procedures = 180, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2023-08-31 23:14:53,589 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:14:53,589 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:14:53,590 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:14:53,590 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:14:53,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,606 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,607 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,611 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:14:53,611 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:14:53,611 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:14:53,611 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:14:53,612 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (1/1) ... [2023-08-31 23:14:53,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:14:53,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:14:53,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:14:53,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:14:53,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-31 23:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:14:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:14:53,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:14:53,664 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:14:53,804 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:14:53,805 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:14:54,063 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:14:54,153 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:14:54,153 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:14:54,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:54 BoogieIcfgContainer [2023-08-31 23:14:54,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:14:54,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:14:54,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:14:54,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:14:54,159 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:14:53" (1/3) ... [2023-08-31 23:14:54,159 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bada6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:54, skipping insertion in model container [2023-08-31 23:14:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:14:53" (2/3) ... [2023-08-31 23:14:54,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bada6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:14:54, skipping insertion in model container [2023-08-31 23:14:54,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:54" (3/3) ... [2023-08-31 23:14:54,161 INFO L112 eAbstractionObserver]: Analyzing ICFG mix021_power.oepc_pso.oepc_rmo.oepc.i [2023-08-31 23:14:54,173 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:14:54,173 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-31 23:14:54,173 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:14:54,226 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:14:54,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:14:54,307 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:14:54,307 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:54,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 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/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:14:54,311 INFO L82 GeneralOperation]: Start removeDead. Operand has 154 places, 143 transitions, 306 flow [2023-08-31 23:14:54,317 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 150 places, 139 transitions, 290 flow [2023-08-31 23:14:54,319 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:14:54,328 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:14:54,330 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 150 places, 139 transitions, 290 flow [2023-08-31 23:14:54,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 290 flow [2023-08-31 23:14:54,366 INFO L130 PetriNetUnfolder]: 2/139 cut-off events. [2023-08-31 23:14:54,366 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:54,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 2/139 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/126 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2023-08-31 23:14:54,370 INFO L119 LiptonReduction]: Number of co-enabled transitions 3524 [2023-08-31 23:14:59,663 INFO L134 LiptonReduction]: Checked pairs total: 9358 [2023-08-31 23:14:59,663 INFO L136 LiptonReduction]: Total number of compositions: 133 [2023-08-31 23:14:59,672 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:14:59,677 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;@eef53f6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:14:59,677 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-31 23:14:59,678 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:14:59,678 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:14:59,678 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:14:59,679 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:14:59,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:14:59,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:14:59,683 INFO L85 PathProgramCache]: Analyzing trace with hash 606, now seen corresponding path program 1 times [2023-08-31 23:14:59,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:14:59,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300591181] [2023-08-31 23:14:59,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:14:59,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:14:59,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:14:59,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:14:59,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:14:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:14:59,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:14:59,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:14:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:14:59,759 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:14:59,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:14:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300591181] [2023-08-31 23:14:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300591181] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:14:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:14:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:14:59,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512323542] [2023-08-31 23:14:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:14:59,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:14:59,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:14:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:14:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:14:59,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 276 [2023-08-31 23:14:59,791 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-31 23:14:59,791 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:14:59,791 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 276 [2023-08-31 23:14:59,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:00,800 INFO L130 PetriNetUnfolder]: 8719/11889 cut-off events. [2023-08-31 23:15:00,800 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-31 23:15:00,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 11889 events. 8719/11889 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 62417 event pairs, 8719 based on Foata normal form. 0/10405 useless extension candidates. Maximal degree in co-relation 23825. Up to 11731 conditions per place. [2023-08-31 23:15:00,852 INFO L137 encePairwiseOnDemand]: 267/276 looper letters, 28 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2023-08-31 23:15:00,852 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 32 transitions, 132 flow [2023-08-31 23:15:00,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:15:00,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:15:00,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 293 transitions. [2023-08-31 23:15:00,861 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5307971014492754 [2023-08-31 23:15:00,861 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 293 transitions. [2023-08-31 23:15:00,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 293 transitions. [2023-08-31 23:15:00,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:00,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 293 transitions. [2023-08-31 23:15:00,866 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 146.5) internal successors, (293), 2 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:00,868 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-31 23:15:00,869 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-31 23:15:00,870 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 2 states and 293 transitions. [2023-08-31 23:15:00,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 32 transitions, 132 flow [2023-08-31 23:15:00,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:00,874 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 72 flow [2023-08-31 23:15:00,875 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-31 23:15:00,877 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -11 predicate places. [2023-08-31 23:15:00,877 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 72 flow [2023-08-31 23:15:00,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:00,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:00,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 23:15:00,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:01,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:01,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:01,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 595464, now seen corresponding path program 1 times [2023-08-31 23:15:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:01,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1858026465] [2023-08-31 23:15:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:01,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:01,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:01,090 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:01,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:15:01,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:01,154 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:01,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:01,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:01,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:01,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:01,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1858026465] [2023-08-31 23:15:01,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1858026465] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:01,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:01,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:15:01,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363965383] [2023-08-31 23:15:01,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:01,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:15:01,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:01,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:15:01,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:15:01,175 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 276 [2023-08-31 23:15:01,176 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.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:01,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:01,184 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 276 [2023-08-31 23:15:01,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:01,921 INFO L130 PetriNetUnfolder]: 6855/9434 cut-off events. [2023-08-31 23:15:01,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:15:01,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18871 conditions, 9434 events. 6855/9434 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 48821 event pairs, 2695 based on Foata normal form. 0/8778 useless extension candidates. Maximal degree in co-relation 18868. Up to 7399 conditions per place. [2023-08-31 23:15:01,962 INFO L137 encePairwiseOnDemand]: 273/276 looper letters, 45 selfloop transitions, 2 changer transitions 2/53 dead transitions. [2023-08-31 23:15:01,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 53 transitions, 218 flow [2023-08-31 23:15:01,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:15:01,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:15:01,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-31 23:15:01,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5205314009661836 [2023-08-31 23:15:01,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-31 23:15:01,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-31 23:15:01,968 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:01,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-31 23:15:01,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:01,972 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-31 23:15:01,973 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-31 23:15:01,973 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 72 flow. Second operand 3 states and 431 transitions. [2023-08-31 23:15:01,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 53 transitions, 218 flow [2023-08-31 23:15:01,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 53 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:15:01,974 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 72 flow [2023-08-31 23:15:01,974 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=72, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2023-08-31 23:15:01,975 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -10 predicate places. [2023-08-31 23:15:01,975 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 72 flow [2023-08-31 23:15:01,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:01,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:01,976 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:01,983 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 (3)] Ended with exit code 0 [2023-08-31 23:15:02,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:02,185 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:02,186 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -819052787, now seen corresponding path program 1 times [2023-08-31 23:15:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:02,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113753442] [2023-08-31 23:15:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:02,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:02,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:02,188 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:02,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:15:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:02,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:02,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:02,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:02,306 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:02,306 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:02,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113753442] [2023-08-31 23:15:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113753442] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:02,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:02,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:02,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835424851] [2023-08-31 23:15:02,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:02,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:02,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:02,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:02,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:02,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-31 23:15:02,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:02,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:02,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-31 23:15:02,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:02,900 INFO L130 PetriNetUnfolder]: 4483/6404 cut-off events. [2023-08-31 23:15:02,900 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2023-08-31 23:15:02,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13353 conditions, 6404 events. 4483/6404 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 325. Compared 34294 event pairs, 818 based on Foata normal form. 320/6496 useless extension candidates. Maximal degree in co-relation 13349. Up to 4756 conditions per place. [2023-08-31 23:15:02,923 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 40 selfloop transitions, 5 changer transitions 27/76 dead transitions. [2023-08-31 23:15:02,923 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 320 flow [2023-08-31 23:15:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 684 transitions. [2023-08-31 23:15:02,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956521739130435 [2023-08-31 23:15:02,925 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 684 transitions. [2023-08-31 23:15:02,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 684 transitions. [2023-08-31 23:15:02,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:02,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 684 transitions. [2023-08-31 23:15:02,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.8) internal successors, (684), 5 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:02,929 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-31 23:15:02,929 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-31 23:15:02,929 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 72 flow. Second operand 5 states and 684 transitions. [2023-08-31 23:15:02,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 320 flow [2023-08-31 23:15:02,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 310 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:02,932 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 113 flow [2023-08-31 23:15:02,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-31 23:15:02,933 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -6 predicate places. [2023-08-31 23:15:02,933 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 113 flow [2023-08-31 23:15:02,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:02,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:02,934 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:02,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:03,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:03,141 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:03,141 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:03,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1027763899, now seen corresponding path program 1 times [2023-08-31 23:15:03,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:03,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864413488] [2023-08-31 23:15:03,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:03,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:03,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:03,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:03,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:15:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:03,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:15:03,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:03,261 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:03,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:03,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864413488] [2023-08-31 23:15:03,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864413488] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:03,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:03,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:03,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261708768] [2023-08-31 23:15:03,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:03,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:03,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:03,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:03,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:03,280 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-31 23:15:03,281 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 113 flow. Second operand has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:03,281 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:03,281 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-31 23:15:03,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:03,717 INFO L130 PetriNetUnfolder]: 2161/3299 cut-off events. [2023-08-31 23:15:03,717 INFO L131 PetriNetUnfolder]: For 1170/1170 co-relation queries the response was YES. [2023-08-31 23:15:03,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8694 conditions, 3299 events. 2161/3299 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 17221 event pairs, 403 based on Foata normal form. 212/3418 useless extension candidates. Maximal degree in co-relation 8687. Up to 1426 conditions per place. [2023-08-31 23:15:03,726 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 53 selfloop transitions, 9 changer transitions 27/93 dead transitions. [2023-08-31 23:15:03,726 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 93 transitions, 469 flow [2023-08-31 23:15:03,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:15:03,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:15:03,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 823 transitions. [2023-08-31 23:15:03,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4969806763285024 [2023-08-31 23:15:03,728 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 823 transitions. [2023-08-31 23:15:03,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 823 transitions. [2023-08-31 23:15:03,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:03,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 823 transitions. [2023-08-31 23:15:03,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:03,732 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-31 23:15:03,733 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-31 23:15:03,733 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 113 flow. Second operand 6 states and 823 transitions. [2023-08-31 23:15:03,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 93 transitions, 469 flow [2023-08-31 23:15:03,740 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 93 transitions, 462 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-31 23:15:03,741 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 178 flow [2023-08-31 23:15:03,741 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=178, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-08-31 23:15:03,741 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-31 23:15:03,742 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 178 flow [2023-08-31 23:15:03,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.0) internal successors, (625), 5 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:03,742 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:03,742 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:03,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:03,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:03,949 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:03,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:03,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1296115085, now seen corresponding path program 1 times [2023-08-31 23:15:03,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:03,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750119387] [2023-08-31 23:15:03,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:03,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:03,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:03,951 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:03,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:15:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:04,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:15:04,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:04,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:04,092 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:04,093 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:04,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750119387] [2023-08-31 23:15:04,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750119387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:04,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:04,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 23:15:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946105246] [2023-08-31 23:15:04,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:04,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:04,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:04,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:04,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-31 23:15:04,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:04,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:04,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-31 23:15:04,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:04,440 INFO L130 PetriNetUnfolder]: 1189/1877 cut-off events. [2023-08-31 23:15:04,441 INFO L131 PetriNetUnfolder]: For 1777/1777 co-relation queries the response was YES. [2023-08-31 23:15:04,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5597 conditions, 1877 events. 1189/1877 cut-off events. For 1777/1777 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 9191 event pairs, 331 based on Foata normal form. 77/1924 useless extension candidates. Maximal degree in co-relation 5588. Up to 630 conditions per place. [2023-08-31 23:15:04,448 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 64 selfloop transitions, 13 changer transitions 27/108 dead transitions. [2023-08-31 23:15:04,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 108 transitions, 638 flow [2023-08-31 23:15:04,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 23:15:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 23:15:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 960 transitions. [2023-08-31 23:15:04,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4968944099378882 [2023-08-31 23:15:04,453 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 960 transitions. [2023-08-31 23:15:04,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 960 transitions. [2023-08-31 23:15:04,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:04,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 960 transitions. [2023-08-31 23:15:04,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 137.14285714285714) internal successors, (960), 7 states have internal predecessors, (960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:04,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:04,458 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 276.0) internal successors, (2208), 8 states have internal predecessors, (2208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:04,458 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 178 flow. Second operand 7 states and 960 transitions. [2023-08-31 23:15:04,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 108 transitions, 638 flow [2023-08-31 23:15:04,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 108 transitions, 576 flow, removed 26 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:04,470 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 228 flow [2023-08-31 23:15:04,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2023-08-31 23:15:04,471 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 1 predicate places. [2023-08-31 23:15:04,471 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 228 flow [2023-08-31 23:15:04,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:04,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:04,474 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-31 23:15:04,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:04,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:04,684 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:04,684 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash 520062741, now seen corresponding path program 1 times [2023-08-31 23:15:04,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:04,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [841964512] [2023-08-31 23:15:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:04,685 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:04,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:04,694 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:04,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-31 23:15:04,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:04,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 23:15:04,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:04,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:04,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:04,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:04,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [841964512] [2023-08-31 23:15:04,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [841964512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:04,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:04,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 23:15:04,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781179419] [2023-08-31 23:15:04,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:04,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 23:15:04,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:04,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 23:15:04,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-31 23:15:04,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 276 [2023-08-31 23:15:04,860 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 228 flow. Second operand has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:04,860 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:04,860 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 276 [2023-08-31 23:15:04,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:05,226 INFO L130 PetriNetUnfolder]: 1011/1571 cut-off events. [2023-08-31 23:15:05,226 INFO L131 PetriNetUnfolder]: For 1422/1422 co-relation queries the response was YES. [2023-08-31 23:15:05,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4523 conditions, 1571 events. 1011/1571 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7528 event pairs, 326 based on Foata normal form. 14/1568 useless extension candidates. Maximal degree in co-relation 4513. Up to 630 conditions per place. [2023-08-31 23:15:05,233 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 60 selfloop transitions, 17 changer transitions 14/95 dead transitions. [2023-08-31 23:15:05,233 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 95 transitions, 574 flow [2023-08-31 23:15:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:15:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:15:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1069 transitions. [2023-08-31 23:15:05,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4841485507246377 [2023-08-31 23:15:05,236 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1069 transitions. [2023-08-31 23:15:05,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1069 transitions. [2023-08-31 23:15:05,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:05,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1069 transitions. [2023-08-31 23:15:05,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:05,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:05,240 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:05,240 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 228 flow. Second operand 8 states and 1069 transitions. [2023-08-31 23:15:05,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 95 transitions, 574 flow [2023-08-31 23:15:05,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 95 transitions, 512 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-08-31 23:15:05,252 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 222 flow [2023-08-31 23:15:05,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=222, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-31 23:15:05,252 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-31 23:15:05,252 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 222 flow [2023-08-31 23:15:05,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:05,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:05,253 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, 1] [2023-08-31 23:15:05,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:05,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:05,460 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:05,460 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:05,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1003412095, now seen corresponding path program 1 times [2023-08-31 23:15:05,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:05,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244650054] [2023-08-31 23:15:05,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:05,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:05,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:05,462 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:05,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-31 23:15:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:05,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:15:05,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:06,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:06,052 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:06,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:06,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244650054] [2023-08-31 23:15:06,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244650054] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:06,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:06,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:06,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431784813] [2023-08-31 23:15:06,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:06,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 23:15:06,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:06,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 23:15:06,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-31 23:15:06,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 276 [2023-08-31 23:15:06,526 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 222 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:06,527 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:06,527 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 276 [2023-08-31 23:15:06,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:06,936 INFO L130 PetriNetUnfolder]: 999/1569 cut-off events. [2023-08-31 23:15:06,936 INFO L131 PetriNetUnfolder]: For 1929/1929 co-relation queries the response was YES. [2023-08-31 23:15:06,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4472 conditions, 1569 events. 999/1569 cut-off events. For 1929/1929 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7665 event pairs, 28 based on Foata normal form. 0/1569 useless extension candidates. Maximal degree in co-relation 4461. Up to 1252 conditions per place. [2023-08-31 23:15:06,943 INFO L137 encePairwiseOnDemand]: 271/276 looper letters, 59 selfloop transitions, 4 changer transitions 0/67 dead transitions. [2023-08-31 23:15:06,943 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 479 flow [2023-08-31 23:15:06,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 23:15:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 23:15:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-31 23:15:06,945 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4178743961352657 [2023-08-31 23:15:06,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-31 23:15:06,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-31 23:15:06,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:06,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-31 23:15:06,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:06,948 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-31 23:15:06,949 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-31 23:15:06,949 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 222 flow. Second operand 6 states and 692 transitions. [2023-08-31 23:15:06,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 479 flow [2023-08-31 23:15:06,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 390 flow, removed 19 selfloop flow, removed 7 redundant places. [2023-08-31 23:15:06,953 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 164 flow [2023-08-31 23:15:06,953 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=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=164, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-31 23:15:06,953 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -1 predicate places. [2023-08-31 23:15:06,953 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 164 flow [2023-08-31 23:15:06,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:06,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:06,954 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, 1] [2023-08-31 23:15:06,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-08-31 23:15:07,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:07,162 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:07,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:07,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1712304673, now seen corresponding path program 1 times [2023-08-31 23:15:07,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:07,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471061804] [2023-08-31 23:15:07,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:15:07,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:07,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:07,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:07,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-31 23:15:07,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:15:07,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:07,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:07,284 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:07,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:07,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471061804] [2023-08-31 23:15:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471061804] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:07,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:07,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:07,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706226988] [2023-08-31 23:15:07,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:07,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:07,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:07,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:07,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:07,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-31 23:15:07,297 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:07,297 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:07,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-31 23:15:07,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:07,536 INFO L130 PetriNetUnfolder]: 1766/2704 cut-off events. [2023-08-31 23:15:07,536 INFO L131 PetriNetUnfolder]: For 1651/1651 co-relation queries the response was YES. [2023-08-31 23:15:07,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7288 conditions, 2704 events. 1766/2704 cut-off events. For 1651/1651 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 14230 event pairs, 765 based on Foata normal form. 1/2672 useless extension candidates. Maximal degree in co-relation 7280. Up to 1522 conditions per place. [2023-08-31 23:15:07,544 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 55 selfloop transitions, 2 changer transitions 12/72 dead transitions. [2023-08-31 23:15:07,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 72 transitions, 436 flow [2023-08-31 23:15:07,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:15:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:15:07,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-31 23:15:07,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49094202898550726 [2023-08-31 23:15:07,546 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-31 23:15:07,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-31 23:15:07,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:07,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-31 23:15:07,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:07,549 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-31 23:15:07,549 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-31 23:15:07,549 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 164 flow. Second operand 4 states and 542 transitions. [2023-08-31 23:15:07,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 72 transitions, 436 flow [2023-08-31 23:15:07,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 426 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 23:15:07,563 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 167 flow [2023-08-31 23:15:07,563 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-31 23:15:07,563 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 0 predicate places. [2023-08-31 23:15:07,564 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 167 flow [2023-08-31 23:15:07,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:07,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:07,564 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, 1] [2023-08-31 23:15:07,571 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 (9)] Ended with exit code 0 [2023-08-31 23:15:07,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:07,772 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:07,772 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash -861620099, now seen corresponding path program 2 times [2023-08-31 23:15:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:07,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [809658730] [2023-08-31 23:15:07,773 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 23:15:07,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:07,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:07,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:07,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-31 23:15:07,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:15:07,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:15:07,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 23:15:07,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:08,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:08,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:08,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [809658730] [2023-08-31 23:15:08,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [809658730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:08,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:08,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-31 23:15:08,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480020362] [2023-08-31 23:15:08,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:08,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-31 23:15:08,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:08,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-31 23:15:08,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-31 23:15:08,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 276 [2023-08-31 23:15:08,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 167 flow. Second operand has 9 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:08,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:08,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 276 [2023-08-31 23:15:08,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:08,745 INFO L130 PetriNetUnfolder]: 901/1508 cut-off events. [2023-08-31 23:15:08,745 INFO L131 PetriNetUnfolder]: For 991/993 co-relation queries the response was YES. [2023-08-31 23:15:08,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4245 conditions, 1508 events. 901/1508 cut-off events. For 991/993 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7858 event pairs, 107 based on Foata normal form. 2/1505 useless extension candidates. Maximal degree in co-relation 4235. Up to 617 conditions per place. [2023-08-31 23:15:08,751 INFO L137 encePairwiseOnDemand]: 269/276 looper letters, 69 selfloop transitions, 4 changer transitions 32/109 dead transitions. [2023-08-31 23:15:08,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 109 transitions, 674 flow [2023-08-31 23:15:08,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 23:15:08,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 23:15:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1038 transitions. [2023-08-31 23:15:08,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701086956521739 [2023-08-31 23:15:08,763 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1038 transitions. [2023-08-31 23:15:08,763 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1038 transitions. [2023-08-31 23:15:08,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:08,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1038 transitions. [2023-08-31 23:15:08,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.75) internal successors, (1038), 8 states have internal predecessors, (1038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:08,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:08,771 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 276.0) internal successors, (2484), 9 states have internal predecessors, (2484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:08,771 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 167 flow. Second operand 8 states and 1038 transitions. [2023-08-31 23:15:08,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 109 transitions, 674 flow [2023-08-31 23:15:08,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 109 transitions, 658 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:08,781 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 175 flow [2023-08-31 23:15:08,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=175, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-08-31 23:15:08,782 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2023-08-31 23:15:08,782 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 175 flow [2023-08-31 23:15:08,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.77777777777777) internal successors, (1114), 9 states have internal predecessors, (1114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:08,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:08,783 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, 1] [2023-08-31 23:15:08,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-08-31 23:15:08,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:08,991 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:08,991 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:08,991 INFO L85 PathProgramCache]: Analyzing trace with hash 2074547687, now seen corresponding path program 3 times [2023-08-31 23:15:08,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:08,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133524009] [2023-08-31 23:15:08,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 23:15:08,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:08,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:08,993 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:09,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-31 23:15:09,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-31 23:15:09,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:15:09,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:15:09,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:09,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:09,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:09,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:09,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133524009] [2023-08-31 23:15:09,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1133524009] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:09,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:09,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 23:15:09,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430313117] [2023-08-31 23:15:09,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:09,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 23:15:09,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:09,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 23:15:09,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 23:15:09,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 276 [2023-08-31 23:15:09,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 175 flow. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:09,133 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:09,133 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 276 [2023-08-31 23:15:09,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:09,409 INFO L130 PetriNetUnfolder]: 1463/2326 cut-off events. [2023-08-31 23:15:09,409 INFO L131 PetriNetUnfolder]: For 2014/2017 co-relation queries the response was YES. [2023-08-31 23:15:09,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 2326 events. 1463/2326 cut-off events. For 2014/2017 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 12304 event pairs, 611 based on Foata normal form. 2/2304 useless extension candidates. Maximal degree in co-relation 6707. Up to 1334 conditions per place. [2023-08-31 23:15:09,416 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 50 selfloop transitions, 2 changer transitions 19/74 dead transitions. [2023-08-31 23:15:09,416 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 74 transitions, 465 flow [2023-08-31 23:15:09,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 23:15:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 23:15:09,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 544 transitions. [2023-08-31 23:15:09,418 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4927536231884058 [2023-08-31 23:15:09,418 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 544 transitions. [2023-08-31 23:15:09,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 544 transitions. [2023-08-31 23:15:09,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:09,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 544 transitions. [2023-08-31 23:15:09,419 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-31 23:15:09,421 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-31 23:15:09,421 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-31 23:15:09,421 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 175 flow. Second operand 4 states and 544 transitions. [2023-08-31 23:15:09,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 74 transitions, 465 flow [2023-08-31 23:15:09,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 447 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-31 23:15:09,438 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 173 flow [2023-08-31 23:15:09,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-08-31 23:15:09,438 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 2 predicate places. [2023-08-31 23:15:09,438 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 173 flow [2023-08-31 23:15:09,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:09,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:09,439 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, 1] [2023-08-31 23:15:09,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-08-31 23:15:09,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:09,646 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:09,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:09,646 INFO L85 PathProgramCache]: Analyzing trace with hash 714385495, now seen corresponding path program 4 times [2023-08-31 23:15:09,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:09,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696445057] [2023-08-31 23:15:09,647 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 23:15:09,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:09,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:09,648 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:09,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-08-31 23:15:09,739 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 23:15:09,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 23:15:09,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 23:15:09,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:15:09,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:15:09,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:15:09,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:15:09,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [696445057] [2023-08-31 23:15:09,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [696445057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:15:09,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:15:09,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 23:15:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424627689] [2023-08-31 23:15:09,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:15:09,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 23:15:09,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:15:09,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 23:15:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-31 23:15:09,798 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 276 [2023-08-31 23:15:09,798 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 173 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:09,798 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:15:09,798 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 276 [2023-08-31 23:15:09,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:15:10,021 INFO L130 PetriNetUnfolder]: 847/1394 cut-off events. [2023-08-31 23:15:10,021 INFO L131 PetriNetUnfolder]: For 1197/1200 co-relation queries the response was YES. [2023-08-31 23:15:10,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 1394 events. 847/1394 cut-off events. For 1197/1200 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6266 event pairs, 316 based on Foata normal form. 1/1390 useless extension candidates. Maximal degree in co-relation 3968. Up to 540 conditions per place. [2023-08-31 23:15:10,025 INFO L137 encePairwiseOnDemand]: 272/276 looper letters, 43 selfloop transitions, 1 changer transitions 34/81 dead transitions. [2023-08-31 23:15:10,025 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 520 flow [2023-08-31 23:15:10,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 23:15:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 23:15:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-08-31 23:15:10,028 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4811594202898551 [2023-08-31 23:15:10,028 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-08-31 23:15:10,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-08-31 23:15:10,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:15:10,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-08-31 23:15:10,029 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-31 23:15:10,031 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-31 23:15:10,031 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-31 23:15:10,031 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 173 flow. Second operand 5 states and 664 transitions. [2023-08-31 23:15:10,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 520 flow [2023-08-31 23:15:10,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 81 transitions, 508 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-31 23:15:10,038 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 174 flow [2023-08-31 23:15:10,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2023-08-31 23:15:10,038 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 5 predicate places. [2023-08-31 23:15:10,038 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 174 flow [2023-08-31 23:15:10,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-31 23:15:10,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:15:10,039 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, 1] [2023-08-31 23:15:10,048 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-31 23:15:10,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:10,246 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-08-31 23:15:10,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:15:10,246 INFO L85 PathProgramCache]: Analyzing trace with hash -662233723, now seen corresponding path program 5 times [2023-08-31 23:15:10,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:15:10,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443288125] [2023-08-31 23:15:10,247 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 23:15:10,247 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:15:10,248 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:15:10,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-08-31 23:15:10,356 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 23:15:10,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-08-31 23:15:10,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:15:10,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:15:10,467 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:15:10,467 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:15:10,467 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-08-31 23:15:10,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-08-31 23:15:10,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-08-31 23:15:10,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-08-31 23:15:10,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-08-31 23:15:10,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:15:10,678 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:15:10,682 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:15:10,682 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:15:10,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:15:10 BasicIcfg [2023-08-31 23:15:10,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:15:10,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:15:10,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:15:10,746 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:15:10,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:14:54" (3/4) ... [2023-08-31 23:15:10,754 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:15:10,754 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:15:10,754 INFO L158 Benchmark]: Toolchain (without parser) took 17617.61ms. Allocated memory was 79.7MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 55.7MB in the beginning and 1.0GB in the end (delta: -981.3MB). Peak memory consumption was 660.8MB. Max. memory is 16.1GB. [2023-08-31 23:15:10,755 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:15:10,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.67ms. Allocated memory is still 79.7MB. Free memory was 55.5MB in the beginning and 51.0MB in the end (delta: 4.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2023-08-31 23:15:10,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.77ms. Allocated memory is still 79.7MB. Free memory was 51.0MB in the beginning and 48.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:10,755 INFO L158 Benchmark]: Boogie Preprocessor took 21.33ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 46.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:15:10,756 INFO L158 Benchmark]: RCFGBuilder took 543.95ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.1MB in the beginning and 66.0MB in the end (delta: -19.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-08-31 23:15:10,756 INFO L158 Benchmark]: TraceAbstraction took 16588.59ms. Allocated memory was 96.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 65.4MB in the beginning and 1.0GB in the end (delta: -971.6MB). Peak memory consumption was 653.5MB. Max. memory is 16.1GB. [2023-08-31 23:15:10,756 INFO L158 Benchmark]: Witness Printer took 8.22ms. Allocated memory is still 1.7GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:15:10,757 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 58.7MB. Free memory is still 36.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.67ms. Allocated memory is still 79.7MB. Free memory was 55.5MB in the beginning and 51.0MB in the end (delta: 4.5MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.77ms. Allocated memory is still 79.7MB. Free memory was 51.0MB in the beginning and 48.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.33ms. Allocated memory is still 79.7MB. Free memory was 48.6MB in the beginning and 46.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 543.95ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.1MB in the beginning and 66.0MB in the end (delta: -19.9MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * TraceAbstraction took 16588.59ms. Allocated memory was 96.5MB in the beginning and 1.7GB in the end (delta: 1.6GB). Free memory was 65.4MB in the beginning and 1.0GB in the end (delta: -971.6MB). Peak memory consumption was 653.5MB. Max. memory is 16.1GB. * Witness Printer took 8.22ms. Allocated memory is still 1.7GB. Free memory is still 1.0GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 150 PlacesBefore, 53 PlacesAfterwards, 139 TransitionsBefore, 41 TransitionsAfterwards, 3524 CoEnabledTransitionPairs, 6 FixpointIterations, 52 TrivialSequentialCompositions, 73 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 133 TotalNumberOfCompositions, 9358 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4634, independent: 4429, independent conditional: 0, independent unconditional: 4429, dependent: 205, dependent conditional: 0, dependent unconditional: 205, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1854, independent: 1819, independent conditional: 0, independent unconditional: 1819, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4634, independent: 2610, independent conditional: 0, independent unconditional: 2610, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1854, unknown conditional: 0, unknown unconditional: 1854] , Statistics on independence cache: Total cache size (in pairs): 223, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool a$flush_delayed; [L720] 0 int a$mem_tmp; [L721] 0 _Bool a$r_buff0_thd0; [L722] 0 _Bool a$r_buff0_thd1; [L723] 0 _Bool a$r_buff0_thd2; [L724] 0 _Bool a$r_buff0_thd3; [L725] 0 _Bool a$r_buff0_thd4; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$r_buff1_thd4; [L731] 0 _Bool a$read_delayed; [L732] 0 int *a$read_delayed_var; [L733] 0 int a$w_buff0; [L734] 0 _Bool a$w_buff0_used; [L735] 0 int a$w_buff1; [L736] 0 _Bool a$w_buff1_used; [L737] 0 _Bool main$tmp_guard0; [L738] 0 _Bool main$tmp_guard1; [L740] 0 int x = 0; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L864] 0 pthread_t t553; [L865] FCALL, FORK 0 pthread_create(&t553, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t553, ((void *)0), P0, ((void *)0))=-1, t553={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L750] 1 a$w_buff1 = a$w_buff0 [L751] 1 a$w_buff0 = 1 [L752] 1 a$w_buff1_used = a$w_buff0_used [L753] 1 a$w_buff0_used = (_Bool)1 [L754] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L754] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L755] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L756] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L757] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L758] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L759] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L866] 0 pthread_t t554; [L867] FCALL, FORK 0 pthread_create(&t554, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t554, ((void *)0), P1, ((void *)0))=0, t553={11:0}, t554={15:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L763] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L868] 0 pthread_t t555; [L780] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L783] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L786] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L787] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L788] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L789] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L790] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L869] FCALL, FORK 0 pthread_create(&t555, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t555, ((void *)0), P2, ((void *)0))=1, t553={11:0}, t554={15:0}, t555={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L870] 0 pthread_t t556; [L871] FCALL, FORK 0 pthread_create(&t556, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t556, ((void *)0), P3, ((void *)0))=2, t553={11:0}, t554={15:0}, t555={7:0}, t556={-2147483637:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L800] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L803] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L806] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L808] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L809] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L810] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L820] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L826] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 4 a$flush_delayed = weak$$choice2 [L829] 4 a$mem_tmp = a [L830] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L831] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L832] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L833] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L834] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L835] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L836] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L837] 4 __unbuffered_p3_EBX = a [L838] 4 a = a$flush_delayed ? a$mem_tmp : a [L839] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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$$choice2=0, x=2, y=2, z=1] [L766] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L767] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L768] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L769] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L770] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=2, z=1] [L842] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L843] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L844] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L845] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L846] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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$$choice2=0, x=2, y=2, z=1] [L773] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L775] 1 return 0; [L849] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L851] 4 return 0; [L873] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L875] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L875] RET 0 assume_abort_if_not(main$tmp_guard0) [L877] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L878] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L879] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L880] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L881] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t553={11:0}, t554={15:0}, t555={7:0}, t556={-2147483637:0}, weak$$choice2=0, x=2, y=2, z=1] [L884] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L886] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] - 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: 862]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 867]: 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: 865]: 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: 871]: 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: 869]: 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, 180 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: 16.4s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 613 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 264 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 231 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2558 IncrementalHoareTripleChecker+Invalid, 2623 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 33 mSDtfsCounter, 2558 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=5, InterpolantAutomatonStates: 58, 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.1s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 210 ConstructedInterpolants, 21 QuantifiedInterpolants, 1992 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1737 ConjunctsInSsa, 82 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:15:10,773 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