./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.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 fa1630ab5b9ca06d45588653daa6fff0d3a2fbd0851a9f5c3999782c5c51eba5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:10:41,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:10:41,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:10:41,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:10:41,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:10:41,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:10:41,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:10:41,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:10:41,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:10:41,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:10:41,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:10:41,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:10:41,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:10:41,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:10:41,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:10:41,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:10:41,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:10:41,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:10:41,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:10:41,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:10:41,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:10:41,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:10:41,510 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:10:41,510 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:10:41,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:10:41,516 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:10:41,517 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:10:41,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:10:41,518 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:10:41,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:10:41,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:10:41,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:10:41,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:10:41,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:10:41,525 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:10:41,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:10:41,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:10:41,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:10:41,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:10:41,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:10:41,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:10:41,530 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 03:10:41,563 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:10:41,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:10:41,565 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:10:41,565 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:10:41,566 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:10:41,566 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:10:41,567 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:10:41,567 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:10:41,567 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:10:41,568 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:10:41,568 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:10:41,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:10:41,569 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:10:41,569 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:10:41,569 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:10:41,569 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:10:41,569 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:10:41,570 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:10:41,570 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:10:41,570 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:10:41,570 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:10:41,570 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:10:41,570 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:10:41,571 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:10:41,571 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:10:41,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:10:41,571 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:10:41,571 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:10:41,572 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 03:10:41,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 03:10:41,572 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:10:41,572 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:10:41,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:10:41,573 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:10:41,573 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 -> fa1630ab5b9ca06d45588653daa6fff0d3a2fbd0851a9f5c3999782c5c51eba5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:10:41,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:10:41,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:10:41,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:10:41,934 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:10:41,936 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:10:41,938 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-08-30 03:10:43,233 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:10:43,522 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:10:43,523 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-08-30 03:10:43,535 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845b60d53/06edd0f828e746cc808ec458b6b68214/FLAG68b986862 [2023-08-30 03:10:43,549 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845b60d53/06edd0f828e746cc808ec458b6b68214 [2023-08-30 03:10:43,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:10:43,552 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:10:43,553 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:10:43,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:10:43,556 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:10:43,557 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:10:43" (1/1) ... [2023-08-30 03:10:43,558 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bcb8317 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:43, skipping insertion in model container [2023-08-30 03:10:43,558 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:10:43" (1/1) ... [2023-08-30 03:10:43,563 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:10:43,603 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:10:43,726 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/safe015_rmo.i[988,1001] [2023-08-30 03:10:43,904 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:10:43,923 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:10:43,955 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/safe015_rmo.i[988,1001] [2023-08-30 03:10:44,037 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:10:44,092 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:10:44,093 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:10:44,098 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:10:44,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44 WrapperNode [2023-08-30 03:10:44,099 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:10:44,101 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:10:44,101 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:10:44,101 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:10:44,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,147 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,179 INFO L138 Inliner]: procedures = 176, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2023-08-30 03:10:44,179 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:10:44,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:10:44,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:10:44,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:10:44,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,190 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,232 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,234 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:10:44,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:10:44,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:10:44,250 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:10:44,251 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (1/1) ... [2023-08-30 03:10:44,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:10:44,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:10:44,303 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:10:44,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:10:44,332 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 03:10:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 03:10:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:10:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:10:44,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:10:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:10:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:10:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:10:44,334 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:10:44,334 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:10:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:10:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:10:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 03:10:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:10:44,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:10:44,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:10:44,337 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:10:44,474 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:10:44,476 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:10:45,119 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:10:45,688 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:10:45,688 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:10:45,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:10:45 BoogieIcfgContainer [2023-08-30 03:10:45,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:10:45,694 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:10:45,694 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:10:45,696 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:10:45,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:10:43" (1/3) ... [2023-08-30 03:10:45,697 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cac16b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:10:45, skipping insertion in model container [2023-08-30 03:10:45,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:10:44" (2/3) ... [2023-08-30 03:10:45,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cac16b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:10:45, skipping insertion in model container [2023-08-30 03:10:45,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:10:45" (3/3) ... [2023-08-30 03:10:45,699 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_rmo.i [2023-08-30 03:10:45,715 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:10:45,716 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-08-30 03:10:45,716 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:10:45,847 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:10:45,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 188 transitions, 391 flow [2023-08-30 03:10:46,001 INFO L130 PetriNetUnfolder]: 2/185 cut-off events. [2023-08-30 03:10:46,001 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:46,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 2/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 342 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-30 03:10:46,008 INFO L82 GeneralOperation]: Start removeDead. Operand has 196 places, 188 transitions, 391 flow [2023-08-30 03:10:46,022 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 185 transitions, 379 flow [2023-08-30 03:10:46,026 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:10:46,044 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 193 places, 185 transitions, 379 flow [2023-08-30 03:10:46,052 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 193 places, 185 transitions, 379 flow [2023-08-30 03:10:46,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 185 transitions, 379 flow [2023-08-30 03:10:46,115 INFO L130 PetriNetUnfolder]: 2/185 cut-off events. [2023-08-30 03:10:46,115 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:10:46,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 195 conditions, 185 events. 2/185 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 343 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-30 03:10:46,121 INFO L119 LiptonReduction]: Number of co-enabled transitions 8576 [2023-08-30 03:11:04,381 INFO L134 LiptonReduction]: Checked pairs total: 63604 [2023-08-30 03:11:04,382 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-30 03:11:04,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:11:04,400 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;@430d9aa8, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:11:04,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-08-30 03:11:04,402 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 03:11:04,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:11:04,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:04,403 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:11:04,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:04,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:04,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1165, now seen corresponding path program 1 times [2023-08-30 03:11:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:04,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840210909] [2023-08-30 03:11:04,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:04,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:04,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:04,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840210909] [2023-08-30 03:11:04,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840210909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:04,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:04,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:11:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689930105] [2023-08-30 03:11:04,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:04,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:11:04,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:04,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:11:04,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:11:04,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 324 [2023-08-30 03:11:04,584 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 flow. Second operand has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:04,584 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:04,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 324 [2023-08-30 03:11:04,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:10,256 INFO L130 PetriNetUnfolder]: 28168/39257 cut-off events. [2023-08-30 03:11:10,257 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 03:11:10,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78563 conditions, 39257 events. 28168/39257 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 3086. Compared 277948 event pairs, 28168 based on Foata normal form. 600/16433 useless extension candidates. Maximal degree in co-relation 78552. Up to 39168 conditions per place. [2023-08-30 03:11:10,527 INFO L137 encePairwiseOnDemand]: 287/324 looper letters, 48 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2023-08-30 03:11:10,527 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 209 flow [2023-08-30 03:11:10,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:11:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:11:10,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2023-08-30 03:11:10,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5200617283950617 [2023-08-30 03:11:10,546 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2023-08-30 03:11:10,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2023-08-30 03:11:10,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:10,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2023-08-30 03:11:10,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:10,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:10,560 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 324.0) internal successors, (972), 3 states have internal predecessors, (972), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:10,562 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 337 transitions. [2023-08-30 03:11:10,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 209 flow [2023-08-30 03:11:10,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:11:10,571 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 110 flow [2023-08-30 03:11:10,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-08-30 03:11:10,576 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -38 predicate places. [2023-08-30 03:11:10,576 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 110 flow [2023-08-30 03:11:10,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:10,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:10,578 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:11:10,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 03:11:10,581 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:10,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:10,589 INFO L85 PathProgramCache]: Analyzing trace with hash 35758449, now seen corresponding path program 1 times [2023-08-30 03:11:10,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:10,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884843824] [2023-08-30 03:11:10,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:10,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:10,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:10,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:10,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:10,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884843824] [2023-08-30 03:11:10,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884843824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:10,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:10,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:11:10,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235021876] [2023-08-30 03:11:10,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:10,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:11:10,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:10,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:11:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:11:10,921 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:11:10,921 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:10,921 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:10,921 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:11:10,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:14,245 INFO L130 PetriNetUnfolder]: 18941/27890 cut-off events. [2023-08-30 03:11:14,245 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:11:14,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55422 conditions, 27890 events. 18941/27890 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1818. Compared 193912 event pairs, 12109 based on Foata normal form. 0/15271 useless extension candidates. Maximal degree in co-relation 55419. Up to 17341 conditions per place. [2023-08-30 03:11:14,456 INFO L137 encePairwiseOnDemand]: 302/324 looper letters, 56 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2023-08-30 03:11:14,456 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 69 transitions, 278 flow [2023-08-30 03:11:14,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:11:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:11:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 432 transitions. [2023-08-30 03:11:14,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-30 03:11:14,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 432 transitions. [2023-08-30 03:11:14,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 432 transitions. [2023-08-30 03:11:14,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:14,461 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 432 transitions. [2023-08-30 03:11:14,462 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:14,466 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:14,467 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:14,467 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 110 flow. Second operand 3 states and 432 transitions. [2023-08-30 03:11:14,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 69 transitions, 278 flow [2023-08-30 03:11:14,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 69 transitions, 278 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:11:14,470 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 200 flow [2023-08-30 03:11:14,470 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-08-30 03:11:14,471 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -37 predicate places. [2023-08-30 03:11:14,471 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 200 flow [2023-08-30 03:11:14,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:14,472 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:14,472 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:11:14,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 03:11:14,472 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:14,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash 35758450, now seen corresponding path program 1 times [2023-08-30 03:11:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:14,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845434502] [2023-08-30 03:11:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:14,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:14,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:14,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:14,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845434502] [2023-08-30 03:11:14,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845434502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:14,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:14,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:11:14,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098615407] [2023-08-30 03:11:14,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:14,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:11:14,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:14,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:11:14,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:11:14,644 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 324 [2023-08-30 03:11:14,645 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:14,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:14,645 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 324 [2023-08-30 03:11:14,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:15,708 INFO L130 PetriNetUnfolder]: 5744/8847 cut-off events. [2023-08-30 03:11:15,708 INFO L131 PetriNetUnfolder]: For 3107/3251 co-relation queries the response was YES. [2023-08-30 03:11:15,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25121 conditions, 8847 events. 5744/8847 cut-off events. For 3107/3251 co-relation queries the response was YES. Maximal size of possible extension queue 643. Compared 56670 event pairs, 4116 based on Foata normal form. 2776/10258 useless extension candidates. Maximal degree in co-relation 25116. Up to 8303 conditions per place. [2023-08-30 03:11:15,751 INFO L137 encePairwiseOnDemand]: 312/324 looper letters, 41 selfloop transitions, 1 changer transitions 1/47 dead transitions. [2023-08-30 03:11:15,751 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 47 transitions, 264 flow [2023-08-30 03:11:15,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:11:15,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:11:15,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-30 03:11:15,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269547325102881 [2023-08-30 03:11:15,754 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-30 03:11:15,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-30 03:11:15,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:15,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-30 03:11:15,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:15,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:15,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:15,762 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 200 flow. Second operand 3 states and 415 transitions. [2023-08-30 03:11:15,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 47 transitions, 264 flow [2023-08-30 03:11:15,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 47 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:15,790 INFO L231 Difference]: Finished difference. Result has 50 places, 46 transitions, 156 flow [2023-08-30 03:11:15,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=46} [2023-08-30 03:11:15,791 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -48 predicate places. [2023-08-30 03:11:15,795 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 46 transitions, 156 flow [2023-08-30 03:11:15,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:15,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:15,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:15,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 03:11:15,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:15,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:15,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1382056752, now seen corresponding path program 1 times [2023-08-30 03:11:15,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:15,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476376439] [2023-08-30 03:11:15,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:15,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:15,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:16,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:16,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:16,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476376439] [2023-08-30 03:11:16,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476376439] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:16,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:16,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:11:16,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502838833] [2023-08-30 03:11:16,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:16,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:11:16,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:11:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:11:16,041 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 324 [2023-08-30 03:11:16,041 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 46 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:16,042 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:16,045 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 324 [2023-08-30 03:11:16,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:16,842 INFO L130 PetriNetUnfolder]: 5327/8412 cut-off events. [2023-08-30 03:11:16,842 INFO L131 PetriNetUnfolder]: For 1188/1256 co-relation queries the response was YES. [2023-08-30 03:11:16,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21921 conditions, 8412 events. 5327/8412 cut-off events. For 1188/1256 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 55135 event pairs, 1918 based on Foata normal form. 0/6224 useless extension candidates. Maximal degree in co-relation 21916. Up to 5973 conditions per place. [2023-08-30 03:11:16,878 INFO L137 encePairwiseOnDemand]: 320/324 looper letters, 63 selfloop transitions, 3 changer transitions 0/70 dead transitions. [2023-08-30 03:11:16,878 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 70 transitions, 370 flow [2023-08-30 03:11:16,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:11:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:11:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2023-08-30 03:11:16,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44135802469135804 [2023-08-30 03:11:16,880 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 429 transitions. [2023-08-30 03:11:16,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 429 transitions. [2023-08-30 03:11:16,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:16,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 429 transitions. [2023-08-30 03:11:16,882 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:16,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:16,884 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:16,885 INFO L175 Difference]: Start difference. First operand has 50 places, 46 transitions, 156 flow. Second operand 3 states and 429 transitions. [2023-08-30 03:11:16,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 70 transitions, 370 flow [2023-08-30 03:11:16,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 70 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:11:16,888 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 168 flow [2023-08-30 03:11:16,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=168, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-08-30 03:11:16,889 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-30 03:11:16,889 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 168 flow [2023-08-30 03:11:16,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:16,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:16,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:16,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 03:11:16,890 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:16,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:16,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1382057073, now seen corresponding path program 1 times [2023-08-30 03:11:16,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:16,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637101130] [2023-08-30 03:11:16,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:16,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:17,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:17,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637101130] [2023-08-30 03:11:17,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637101130] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:17,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:17,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:11:17,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457939182] [2023-08-30 03:11:17,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:17,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:11:17,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:17,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:11:17,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:11:17,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 324 [2023-08-30 03:11:17,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 168 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:17,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:17,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 324 [2023-08-30 03:11:17,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:19,034 INFO L130 PetriNetUnfolder]: 6394/9710 cut-off events. [2023-08-30 03:11:19,034 INFO L131 PetriNetUnfolder]: For 2076/2192 co-relation queries the response was YES. [2023-08-30 03:11:19,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26406 conditions, 9710 events. 6394/9710 cut-off events. For 2076/2192 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 59745 event pairs, 2462 based on Foata normal form. 13/7498 useless extension candidates. Maximal degree in co-relation 26400. Up to 9030 conditions per place. [2023-08-30 03:11:19,104 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 70 selfloop transitions, 12 changer transitions 0/85 dead transitions. [2023-08-30 03:11:19,104 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 478 flow [2023-08-30 03:11:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:11:19,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:11:19,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 535 transitions. [2023-08-30 03:11:19,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41280864197530864 [2023-08-30 03:11:19,106 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 535 transitions. [2023-08-30 03:11:19,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 535 transitions. [2023-08-30 03:11:19,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:19,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 535 transitions. [2023-08-30 03:11:19,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:19,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:19,111 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:19,111 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 168 flow. Second operand 4 states and 535 transitions. [2023-08-30 03:11:19,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 478 flow [2023-08-30 03:11:19,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 85 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:19,114 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 263 flow [2023-08-30 03:11:19,114 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2023-08-30 03:11:19,115 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -44 predicate places. [2023-08-30 03:11:19,115 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 263 flow [2023-08-30 03:11:19,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:19,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:19,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:19,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 03:11:19,116 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:19,117 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash -105905174, now seen corresponding path program 1 times [2023-08-30 03:11:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628279608] [2023-08-30 03:11:19,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:20,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:20,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628279608] [2023-08-30 03:11:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628279608] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:20,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:20,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:11:20,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151573110] [2023-08-30 03:11:20,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:20,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:11:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:20,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:11:20,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:11:20,708 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 324 [2023-08-30 03:11:20,709 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 263 flow. Second operand has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:20,709 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:20,709 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 324 [2023-08-30 03:11:20,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:21,748 INFO L130 PetriNetUnfolder]: 5493/8582 cut-off events. [2023-08-30 03:11:21,749 INFO L131 PetriNetUnfolder]: For 2780/2780 co-relation queries the response was YES. [2023-08-30 03:11:21,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25694 conditions, 8582 events. 5493/8582 cut-off events. For 2780/2780 co-relation queries the response was YES. Maximal size of possible extension queue 635. Compared 54773 event pairs, 2178 based on Foata normal form. 3/6779 useless extension candidates. Maximal degree in co-relation 25686. Up to 8043 conditions per place. [2023-08-30 03:11:21,786 INFO L137 encePairwiseOnDemand]: 315/324 looper letters, 81 selfloop transitions, 25 changer transitions 0/107 dead transitions. [2023-08-30 03:11:21,786 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 107 transitions, 703 flow [2023-08-30 03:11:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:11:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:11:21,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-08-30 03:11:21,789 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36331569664902996 [2023-08-30 03:11:21,789 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-08-30 03:11:21,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-08-30 03:11:21,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:21,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-08-30 03:11:21,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:21,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:21,795 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:21,795 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 263 flow. Second operand 7 states and 824 transitions. [2023-08-30 03:11:21,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 107 transitions, 703 flow [2023-08-30 03:11:21,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 107 transitions, 703 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:11:21,825 INFO L231 Difference]: Finished difference. Result has 64 places, 79 transitions, 506 flow [2023-08-30 03:11:21,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=506, PETRI_PLACES=64, PETRI_TRANSITIONS=79} [2023-08-30 03:11:21,825 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -34 predicate places. [2023-08-30 03:11:21,826 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 79 transitions, 506 flow [2023-08-30 03:11:21,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.71428571428571) internal successors, (761), 7 states have internal predecessors, (761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:21,826 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:21,826 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:21,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 03:11:21,826 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:21,827 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash -105904523, now seen corresponding path program 1 times [2023-08-30 03:11:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:21,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367211788] [2023-08-30 03:11:21,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:21,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:22,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:22,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:22,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367211788] [2023-08-30 03:11:22,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367211788] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:22,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:22,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:11:22,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792347048] [2023-08-30 03:11:22,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:22,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:11:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:22,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:11:22,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:11:22,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:11:22,240 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 79 transitions, 506 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-30 03:11:22,240 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:22,240 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:11:22,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:23,286 INFO L130 PetriNetUnfolder]: 6432/9757 cut-off events. [2023-08-30 03:11:23,286 INFO L131 PetriNetUnfolder]: For 6501/6651 co-relation queries the response was YES. [2023-08-30 03:11:23,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31408 conditions, 9757 events. 6432/9757 cut-off events. For 6501/6651 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 59538 event pairs, 3285 based on Foata normal form. 13/7765 useless extension candidates. Maximal degree in co-relation 31395. Up to 8863 conditions per place. [2023-08-30 03:11:23,330 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 110 selfloop transitions, 12 changer transitions 0/125 dead transitions. [2023-08-30 03:11:23,331 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 125 transitions, 954 flow [2023-08-30 03:11:23,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:11:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:11:23,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 563 transitions. [2023-08-30 03:11:23,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43441358024691357 [2023-08-30 03:11:23,333 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 563 transitions. [2023-08-30 03:11:23,333 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 563 transitions. [2023-08-30 03:11:23,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:23,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 563 transitions. [2023-08-30 03:11:23,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.75) internal successors, (563), 4 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:23,337 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:23,337 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:23,337 INFO L175 Difference]: Start difference. First operand has 64 places, 79 transitions, 506 flow. Second operand 4 states and 563 transitions. [2023-08-30 03:11:23,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 125 transitions, 954 flow [2023-08-30 03:11:23,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 125 transitions, 951 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:11:23,420 INFO L231 Difference]: Finished difference. Result has 67 places, 81 transitions, 548 flow [2023-08-30 03:11:23,420 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=548, PETRI_PLACES=67, PETRI_TRANSITIONS=81} [2023-08-30 03:11:23,420 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -31 predicate places. [2023-08-30 03:11:23,420 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 81 transitions, 548 flow [2023-08-30 03:11:23,421 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-30 03:11:23,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:23,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:23,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 03:11:23,421 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:23,421 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:23,421 INFO L85 PathProgramCache]: Analyzing trace with hash -105904844, now seen corresponding path program 1 times [2023-08-30 03:11:23,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:23,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091652040] [2023-08-30 03:11:23,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:23,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:23,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:23,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091652040] [2023-08-30 03:11:23,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091652040] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:23,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:23,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:11:23,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895209980] [2023-08-30 03:11:23,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:23,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:11:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:23,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:11:23,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:11:23,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 324 [2023-08-30 03:11:23,591 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 81 transitions, 548 flow. Second operand has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:23,591 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:23,591 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 324 [2023-08-30 03:11:23,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:25,288 INFO L130 PetriNetUnfolder]: 6946/10751 cut-off events. [2023-08-30 03:11:25,288 INFO L131 PetriNetUnfolder]: For 8752/8752 co-relation queries the response was YES. [2023-08-30 03:11:25,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36115 conditions, 10751 events. 6946/10751 cut-off events. For 8752/8752 co-relation queries the response was YES. Maximal size of possible extension queue 778. Compared 69876 event pairs, 1851 based on Foata normal form. 0/8637 useless extension candidates. Maximal degree in co-relation 36100. Up to 4916 conditions per place. [2023-08-30 03:11:25,342 INFO L137 encePairwiseOnDemand]: 312/324 looper letters, 68 selfloop transitions, 35 changer transitions 0/105 dead transitions. [2023-08-30 03:11:25,342 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 864 flow [2023-08-30 03:11:25,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:11:25,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:11:25,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 534 transitions. [2023-08-30 03:11:25,344 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41203703703703703 [2023-08-30 03:11:25,344 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 534 transitions. [2023-08-30 03:11:25,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 534 transitions. [2023-08-30 03:11:25,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:25,345 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 534 transitions. [2023-08-30 03:11:25,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:25,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:25,349 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:25,349 INFO L175 Difference]: Start difference. First operand has 67 places, 81 transitions, 548 flow. Second operand 4 states and 534 transitions. [2023-08-30 03:11:25,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 864 flow [2023-08-30 03:11:25,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 105 transitions, 837 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:25,451 INFO L231 Difference]: Finished difference. Result has 67 places, 84 transitions, 623 flow [2023-08-30 03:11:25,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=623, PETRI_PLACES=67, PETRI_TRANSITIONS=84} [2023-08-30 03:11:25,451 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -31 predicate places. [2023-08-30 03:11:25,452 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 84 transitions, 623 flow [2023-08-30 03:11:25,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.0) internal successors, (480), 4 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:25,452 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:25,452 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:25,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 03:11:25,453 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:25,453 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash -105904843, now seen corresponding path program 1 times [2023-08-30 03:11:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:25,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848803002] [2023-08-30 03:11:25,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:25,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:25,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:25,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:25,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848803002] [2023-08-30 03:11:25,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848803002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:25,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:25,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:11:25,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079829152] [2023-08-30 03:11:25,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:25,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:11:25,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:25,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:11:25,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:11:25,689 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 324 [2023-08-30 03:11:25,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 84 transitions, 623 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:25,691 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:25,691 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 324 [2023-08-30 03:11:25,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:27,271 INFO L130 PetriNetUnfolder]: 6762/10487 cut-off events. [2023-08-30 03:11:27,272 INFO L131 PetriNetUnfolder]: For 11428/11437 co-relation queries the response was YES. [2023-08-30 03:11:27,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37515 conditions, 10487 events. 6762/10487 cut-off events. For 11428/11437 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 68351 event pairs, 1766 based on Foata normal form. 60/9326 useless extension candidates. Maximal degree in co-relation 37500. Up to 8196 conditions per place. [2023-08-30 03:11:27,332 INFO L137 encePairwiseOnDemand]: 321/324 looper letters, 87 selfloop transitions, 15 changer transitions 0/105 dead transitions. [2023-08-30 03:11:27,332 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 105 transitions, 933 flow [2023-08-30 03:11:27,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:11:27,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:11:27,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 521 transitions. [2023-08-30 03:11:27,334 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4020061728395062 [2023-08-30 03:11:27,334 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 521 transitions. [2023-08-30 03:11:27,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 521 transitions. [2023-08-30 03:11:27,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:27,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 521 transitions. [2023-08-30 03:11:27,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.25) internal successors, (521), 4 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:27,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:27,338 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:27,339 INFO L175 Difference]: Start difference. First operand has 67 places, 84 transitions, 623 flow. Second operand 4 states and 521 transitions. [2023-08-30 03:11:27,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 105 transitions, 933 flow [2023-08-30 03:11:27,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 105 transitions, 880 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:27,572 INFO L231 Difference]: Finished difference. Result has 67 places, 83 transitions, 602 flow [2023-08-30 03:11:27,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=602, PETRI_PLACES=67, PETRI_TRANSITIONS=83} [2023-08-30 03:11:27,573 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -31 predicate places. [2023-08-30 03:11:27,573 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 83 transitions, 602 flow [2023-08-30 03:11:27,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:27,574 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:27,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:27,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 03:11:27,574 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:27,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:27,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1532306540, now seen corresponding path program 1 times [2023-08-30 03:11:27,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:27,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951146557] [2023-08-30 03:11:27,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:27,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:28,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:28,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:28,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951146557] [2023-08-30 03:11:28,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951146557] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:28,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:28,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:11:28,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125376947] [2023-08-30 03:11:28,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:11:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:11:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:11:28,170 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 324 [2023-08-30 03:11:28,171 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 83 transitions, 602 flow. Second operand has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:28,171 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:28,171 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 324 [2023-08-30 03:11:28,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:29,380 INFO L130 PetriNetUnfolder]: 6558/10208 cut-off events. [2023-08-30 03:11:29,380 INFO L131 PetriNetUnfolder]: For 10991/11072 co-relation queries the response was YES. [2023-08-30 03:11:29,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34791 conditions, 10208 events. 6558/10208 cut-off events. For 10991/11072 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 67416 event pairs, 1843 based on Foata normal form. 12/8012 useless extension candidates. Maximal degree in co-relation 34777. Up to 7751 conditions per place. [2023-08-30 03:11:29,431 INFO L137 encePairwiseOnDemand]: 321/324 looper letters, 82 selfloop transitions, 15 changer transitions 0/102 dead transitions. [2023-08-30 03:11:29,431 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 102 transitions, 883 flow [2023-08-30 03:11:29,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:11:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:11:29,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2023-08-30 03:11:29,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4403292181069959 [2023-08-30 03:11:29,433 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2023-08-30 03:11:29,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2023-08-30 03:11:29,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:29,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2023-08-30 03:11:29,434 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-30 03:11:29,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:29,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:29,436 INFO L175 Difference]: Start difference. First operand has 67 places, 83 transitions, 602 flow. Second operand 3 states and 428 transitions. [2023-08-30 03:11:29,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 102 transitions, 883 flow [2023-08-30 03:11:29,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 102 transitions, 867 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:29,542 INFO L231 Difference]: Finished difference. Result has 68 places, 83 transitions, 633 flow [2023-08-30 03:11:29,542 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=586, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=633, PETRI_PLACES=68, PETRI_TRANSITIONS=83} [2023-08-30 03:11:29,543 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -30 predicate places. [2023-08-30 03:11:29,543 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 83 transitions, 633 flow [2023-08-30 03:11:29,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:29,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:29,543 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:29,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 03:11:29,544 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:29,544 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1491594426, now seen corresponding path program 1 times [2023-08-30 03:11:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:29,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44071725] [2023-08-30 03:11:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44071725] [2023-08-30 03:11:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44071725] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:31,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:11:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595874473] [2023-08-30 03:11:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:31,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:11:31,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:31,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:11:31,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:11:31,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 324 [2023-08-30 03:11:31,351 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 83 transitions, 633 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:31,351 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:31,351 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 324 [2023-08-30 03:11:31,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:32,751 INFO L130 PetriNetUnfolder]: 6755/10466 cut-off events. [2023-08-30 03:11:32,752 INFO L131 PetriNetUnfolder]: For 10387/10387 co-relation queries the response was YES. [2023-08-30 03:11:32,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36779 conditions, 10466 events. 6755/10466 cut-off events. For 10387/10387 co-relation queries the response was YES. Maximal size of possible extension queue 777. Compared 67760 event pairs, 2007 based on Foata normal form. 7/8359 useless extension candidates. Maximal degree in co-relation 36764. Up to 9187 conditions per place. [2023-08-30 03:11:32,810 INFO L137 encePairwiseOnDemand]: 314/324 looper letters, 112 selfloop transitions, 42 changer transitions 0/156 dead transitions. [2023-08-30 03:11:32,810 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 156 transitions, 1262 flow [2023-08-30 03:11:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:11:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:11:32,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1153 transitions. [2023-08-30 03:11:32,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3558641975308642 [2023-08-30 03:11:32,813 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1153 transitions. [2023-08-30 03:11:32,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1153 transitions. [2023-08-30 03:11:32,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:32,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1153 transitions. [2023-08-30 03:11:32,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 115.3) internal successors, (1153), 10 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:32,819 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 324.0) internal successors, (3564), 11 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:32,820 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 324.0) internal successors, (3564), 11 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:32,820 INFO L175 Difference]: Start difference. First operand has 68 places, 83 transitions, 633 flow. Second operand 10 states and 1153 transitions. [2023-08-30 03:11:32,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 156 transitions, 1262 flow [2023-08-30 03:11:32,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 156 transitions, 1232 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:32,931 INFO L231 Difference]: Finished difference. Result has 77 places, 100 transitions, 839 flow [2023-08-30 03:11:32,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=603, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=839, PETRI_PLACES=77, PETRI_TRANSITIONS=100} [2023-08-30 03:11:32,931 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2023-08-30 03:11:32,931 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 100 transitions, 839 flow [2023-08-30 03:11:32,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:32,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:32,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:32,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 03:11:32,933 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:32,933 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:32,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1011968680, now seen corresponding path program 1 times [2023-08-30 03:11:32,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:32,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724932828] [2023-08-30 03:11:32,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:32,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:33,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:33,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724932828] [2023-08-30 03:11:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724932828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:33,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:11:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089085322] [2023-08-30 03:11:33,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:33,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:11:33,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:33,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:11:33,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:11:33,152 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 324 [2023-08-30 03:11:33,153 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 100 transitions, 839 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:33,153 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:33,153 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 324 [2023-08-30 03:11:33,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:34,146 INFO L130 PetriNetUnfolder]: 5809/8995 cut-off events. [2023-08-30 03:11:34,146 INFO L131 PetriNetUnfolder]: For 13386/13386 co-relation queries the response was YES. [2023-08-30 03:11:34,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34888 conditions, 8995 events. 5809/8995 cut-off events. For 13386/13386 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 56621 event pairs, 1822 based on Foata normal form. 74/7502 useless extension candidates. Maximal degree in co-relation 34871. Up to 3739 conditions per place. [2023-08-30 03:11:34,192 INFO L137 encePairwiseOnDemand]: 306/324 looper letters, 101 selfloop transitions, 34 changer transitions 0/137 dead transitions. [2023-08-30 03:11:34,192 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 137 transitions, 1372 flow [2023-08-30 03:11:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:11:34,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:11:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-30 03:11:34,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4012345679012346 [2023-08-30 03:11:34,194 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-30 03:11:34,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-30 03:11:34,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:34,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-30 03:11:34,195 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:34,196 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:34,196 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:34,196 INFO L175 Difference]: Start difference. First operand has 77 places, 100 transitions, 839 flow. Second operand 4 states and 520 transitions. [2023-08-30 03:11:34,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 137 transitions, 1372 flow [2023-08-30 03:11:34,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 137 transitions, 1296 flow, removed 18 selfloop flow, removed 5 redundant places. [2023-08-30 03:11:34,293 INFO L231 Difference]: Finished difference. Result has 77 places, 112 transitions, 1030 flow [2023-08-30 03:11:34,293 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1030, PETRI_PLACES=77, PETRI_TRANSITIONS=112} [2023-08-30 03:11:34,294 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -21 predicate places. [2023-08-30 03:11:34,294 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 112 transitions, 1030 flow [2023-08-30 03:11:34,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:34,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:34,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:34,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-30 03:11:34,295 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:34,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:34,295 INFO L85 PathProgramCache]: Analyzing trace with hash -608523208, now seen corresponding path program 1 times [2023-08-30 03:11:34,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:34,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918120390] [2023-08-30 03:11:34,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:34,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:34,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:35,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:35,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:35,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918120390] [2023-08-30 03:11:35,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918120390] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:35,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:35,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:11:35,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328540096] [2023-08-30 03:11:35,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:35,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:11:35,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:35,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:11:35,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:11:35,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 324 [2023-08-30 03:11:35,706 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 112 transitions, 1030 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:35,707 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:35,707 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 324 [2023-08-30 03:11:35,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:37,126 INFO L130 PetriNetUnfolder]: 7188/11132 cut-off events. [2023-08-30 03:11:37,126 INFO L131 PetriNetUnfolder]: For 22575/22638 co-relation queries the response was YES. [2023-08-30 03:11:37,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47800 conditions, 11132 events. 7188/11132 cut-off events. For 22575/22638 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 72129 event pairs, 1952 based on Foata normal form. 50/10162 useless extension candidates. Maximal degree in co-relation 47781. Up to 8075 conditions per place. [2023-08-30 03:11:37,194 INFO L137 encePairwiseOnDemand]: 316/324 looper letters, 154 selfloop transitions, 33 changer transitions 0/190 dead transitions. [2023-08-30 03:11:37,194 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 190 transitions, 2012 flow [2023-08-30 03:11:37,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:11:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:11:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 783 transitions. [2023-08-30 03:11:37,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4027777777777778 [2023-08-30 03:11:37,196 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 783 transitions. [2023-08-30 03:11:37,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 783 transitions. [2023-08-30 03:11:37,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:37,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 783 transitions. [2023-08-30 03:11:37,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:37,200 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:37,201 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:37,201 INFO L175 Difference]: Start difference. First operand has 77 places, 112 transitions, 1030 flow. Second operand 6 states and 783 transitions. [2023-08-30 03:11:37,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 190 transitions, 2012 flow [2023-08-30 03:11:37,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 190 transitions, 2002 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:11:37,475 INFO L231 Difference]: Finished difference. Result has 82 places, 126 transitions, 1310 flow [2023-08-30 03:11:37,475 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=1020, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1310, PETRI_PLACES=82, PETRI_TRANSITIONS=126} [2023-08-30 03:11:37,476 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -16 predicate places. [2023-08-30 03:11:37,476 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 126 transitions, 1310 flow [2023-08-30 03:11:37,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:37,477 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:37,477 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:37,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 03:11:37,477 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:37,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:37,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1121682648, now seen corresponding path program 2 times [2023-08-30 03:11:37,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:37,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704474283] [2023-08-30 03:11:37,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:37,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:37,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:38,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704474283] [2023-08-30 03:11:38,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704474283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 03:11:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146650427] [2023-08-30 03:11:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:38,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 03:11:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 03:11:38,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-30 03:11:39,032 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 324 [2023-08-30 03:11:39,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 126 transitions, 1310 flow. Second operand has 10 states, 10 states have (on average 104.4) internal successors, (1044), 10 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:39,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:39,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 324 [2023-08-30 03:11:39,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:40,636 INFO L130 PetriNetUnfolder]: 7027/10955 cut-off events. [2023-08-30 03:11:40,637 INFO L131 PetriNetUnfolder]: For 25943/25997 co-relation queries the response was YES. [2023-08-30 03:11:40,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49461 conditions, 10955 events. 7027/10955 cut-off events. For 25943/25997 co-relation queries the response was YES. Maximal size of possible extension queue 812. Compared 71768 event pairs, 481 based on Foata normal form. 33/10071 useless extension candidates. Maximal degree in co-relation 49439. Up to 3927 conditions per place. [2023-08-30 03:11:40,711 INFO L137 encePairwiseOnDemand]: 313/324 looper letters, 187 selfloop transitions, 110 changer transitions 0/299 dead transitions. [2023-08-30 03:11:40,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 299 transitions, 3169 flow [2023-08-30 03:11:40,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-30 03:11:40,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-30 03:11:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1479 transitions. [2023-08-30 03:11:40,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35113960113960113 [2023-08-30 03:11:40,715 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1479 transitions. [2023-08-30 03:11:40,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1479 transitions. [2023-08-30 03:11:40,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:40,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1479 transitions. [2023-08-30 03:11:40,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 113.76923076923077) internal successors, (1479), 13 states have internal predecessors, (1479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:40,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 324.0) internal successors, (4536), 14 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:40,724 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 324.0) internal successors, (4536), 14 states have internal predecessors, (4536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:40,724 INFO L175 Difference]: Start difference. First operand has 82 places, 126 transitions, 1310 flow. Second operand 13 states and 1479 transitions. [2023-08-30 03:11:40,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 299 transitions, 3169 flow [2023-08-30 03:11:41,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 299 transitions, 3150 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-30 03:11:41,025 INFO L231 Difference]: Finished difference. Result has 97 places, 182 transitions, 2310 flow [2023-08-30 03:11:41,025 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2310, PETRI_PLACES=97, PETRI_TRANSITIONS=182} [2023-08-30 03:11:41,026 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -1 predicate places. [2023-08-30 03:11:41,026 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 182 transitions, 2310 flow [2023-08-30 03:11:41,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.4) internal successors, (1044), 10 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:41,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:41,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:41,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-30 03:11:41,027 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:41,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:41,028 INFO L85 PathProgramCache]: Analyzing trace with hash -467565422, now seen corresponding path program 1 times [2023-08-30 03:11:41,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:41,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579616191] [2023-08-30 03:11:41,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:41,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:41,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:41,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:41,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579616191] [2023-08-30 03:11:41,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579616191] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:41,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:41,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:11:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148658547] [2023-08-30 03:11:41,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:41,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:11:41,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:11:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:11:41,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:11:41,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 182 transitions, 2310 flow. Second operand has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:41,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:41,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:11:41,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:43,745 INFO L130 PetriNetUnfolder]: 10042/15948 cut-off events. [2023-08-30 03:11:43,745 INFO L131 PetriNetUnfolder]: For 59834/59988 co-relation queries the response was YES. [2023-08-30 03:11:43,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76057 conditions, 15948 events. 10042/15948 cut-off events. For 59834/59988 co-relation queries the response was YES. Maximal size of possible extension queue 1062. Compared 115024 event pairs, 1686 based on Foata normal form. 106/14669 useless extension candidates. Maximal degree in co-relation 76030. Up to 6709 conditions per place. [2023-08-30 03:11:43,886 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 203 selfloop transitions, 45 changer transitions 0/276 dead transitions. [2023-08-30 03:11:43,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 276 transitions, 3775 flow [2023-08-30 03:11:43,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:11:43,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:11:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2023-08-30 03:11:43,888 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41975308641975306 [2023-08-30 03:11:43,888 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2023-08-30 03:11:43,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2023-08-30 03:11:43,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:43,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2023-08-30 03:11:43,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:43,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:43,893 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:43,893 INFO L175 Difference]: Start difference. First operand has 97 places, 182 transitions, 2310 flow. Second operand 5 states and 680 transitions. [2023-08-30 03:11:43,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 276 transitions, 3775 flow [2023-08-30 03:11:44,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 276 transitions, 3600 flow, removed 86 selfloop flow, removed 1 redundant places. [2023-08-30 03:11:44,481 INFO L231 Difference]: Finished difference. Result has 101 places, 182 transitions, 2306 flow [2023-08-30 03:11:44,481 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=2211, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2306, PETRI_PLACES=101, PETRI_TRANSITIONS=182} [2023-08-30 03:11:44,481 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 3 predicate places. [2023-08-30 03:11:44,481 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 182 transitions, 2306 flow [2023-08-30 03:11:44,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 124.33333333333333) internal successors, (746), 6 states have internal predecessors, (746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:44,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:44,482 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:44,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 03:11:44,482 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:44,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:44,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1839292553, now seen corresponding path program 1 times [2023-08-30 03:11:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021265190] [2023-08-30 03:11:44,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:44,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:44,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:44,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:44,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021265190] [2023-08-30 03:11:44,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021265190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:44,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:44,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:11:44,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641503346] [2023-08-30 03:11:44,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:44,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:11:44,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:44,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:11:44,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:11:45,057 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 324 [2023-08-30 03:11:45,061 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 182 transitions, 2306 flow. Second operand has 8 states, 8 states have (on average 111.875) internal successors, (895), 8 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:45,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:45,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 324 [2023-08-30 03:11:45,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:46,587 INFO L130 PetriNetUnfolder]: 6361/10438 cut-off events. [2023-08-30 03:11:46,587 INFO L131 PetriNetUnfolder]: For 42848/42977 co-relation queries the response was YES. [2023-08-30 03:11:46,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47722 conditions, 10438 events. 6361/10438 cut-off events. For 42848/42977 co-relation queries the response was YES. Maximal size of possible extension queue 727. Compared 73069 event pairs, 1397 based on Foata normal form. 15/10439 useless extension candidates. Maximal degree in co-relation 47693. Up to 3742 conditions per place. [2023-08-30 03:11:46,657 INFO L137 encePairwiseOnDemand]: 317/324 looper letters, 152 selfloop transitions, 35 changer transitions 2/219 dead transitions. [2023-08-30 03:11:46,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 219 transitions, 2885 flow [2023-08-30 03:11:46,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:11:46,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:11:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 842 transitions. [2023-08-30 03:11:46,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3712522045855379 [2023-08-30 03:11:46,660 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 842 transitions. [2023-08-30 03:11:46,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 842 transitions. [2023-08-30 03:11:46,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:46,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 842 transitions. [2023-08-30 03:11:46,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:46,665 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:46,666 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:46,666 INFO L175 Difference]: Start difference. First operand has 101 places, 182 transitions, 2306 flow. Second operand 7 states and 842 transitions. [2023-08-30 03:11:46,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 219 transitions, 2885 flow [2023-08-30 03:11:46,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 219 transitions, 2759 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-30 03:11:46,828 INFO L231 Difference]: Finished difference. Result has 103 places, 161 transitions, 2005 flow [2023-08-30 03:11:46,829 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=1967, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2005, PETRI_PLACES=103, PETRI_TRANSITIONS=161} [2023-08-30 03:11:46,829 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2023-08-30 03:11:46,829 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 161 transitions, 2005 flow [2023-08-30 03:11:46,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.875) internal successors, (895), 8 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:46,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:46,830 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:46,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-30 03:11:46,830 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:46,831 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:46,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1306257975, now seen corresponding path program 1 times [2023-08-30 03:11:46,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:46,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104964552] [2023-08-30 03:11:46,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:46,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:47,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104964552] [2023-08-30 03:11:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104964552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:47,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:47,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:11:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50203877] [2023-08-30 03:11:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:47,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:11:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:11:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:11:47,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 324 [2023-08-30 03:11:47,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 161 transitions, 2005 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:47,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:47,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 324 [2023-08-30 03:11:47,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:48,393 INFO L130 PetriNetUnfolder]: 5402/8726 cut-off events. [2023-08-30 03:11:48,393 INFO L131 PetriNetUnfolder]: For 33563/33608 co-relation queries the response was YES. [2023-08-30 03:11:48,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39771 conditions, 8726 events. 5402/8726 cut-off events. For 33563/33608 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 56708 event pairs, 1513 based on Foata normal form. 242/8963 useless extension candidates. Maximal degree in co-relation 39742. Up to 3724 conditions per place. [2023-08-30 03:11:48,447 INFO L137 encePairwiseOnDemand]: 308/324 looper letters, 160 selfloop transitions, 44 changer transitions 0/206 dead transitions. [2023-08-30 03:11:48,447 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 206 transitions, 2767 flow [2023-08-30 03:11:48,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:11:48,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:11:48,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions. [2023-08-30 03:11:48,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.382201646090535 [2023-08-30 03:11:48,449 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 743 transitions. [2023-08-30 03:11:48,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions. [2023-08-30 03:11:48,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:48,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions. [2023-08-30 03:11:48,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:48,453 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:48,453 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:48,454 INFO L175 Difference]: Start difference. First operand has 103 places, 161 transitions, 2005 flow. Second operand 6 states and 743 transitions. [2023-08-30 03:11:48,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 206 transitions, 2767 flow [2023-08-30 03:11:48,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 206 transitions, 2697 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-30 03:11:48,570 INFO L231 Difference]: Finished difference. Result has 104 places, 165 transitions, 2150 flow [2023-08-30 03:11:48,570 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=1935, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2150, PETRI_PLACES=104, PETRI_TRANSITIONS=165} [2023-08-30 03:11:48,570 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2023-08-30 03:11:48,570 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 165 transitions, 2150 flow [2023-08-30 03:11:48,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:48,571 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:48,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:48,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 03:11:48,571 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:48,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash -775365053, now seen corresponding path program 1 times [2023-08-30 03:11:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124854231] [2023-08-30 03:11:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:48,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:48,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:48,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124854231] [2023-08-30 03:11:48,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124854231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:48,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:48,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:11:48,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228819199] [2023-08-30 03:11:48,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:48,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:11:48,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:48,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:11:48,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:11:48,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:11:48,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 165 transitions, 2150 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:48,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:48,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:11:48,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:49,363 INFO L130 PetriNetUnfolder]: 1743/3237 cut-off events. [2023-08-30 03:11:49,363 INFO L131 PetriNetUnfolder]: For 14977/15024 co-relation queries the response was YES. [2023-08-30 03:11:49,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15225 conditions, 3237 events. 1743/3237 cut-off events. For 14977/15024 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 20953 event pairs, 327 based on Foata normal form. 80/3312 useless extension candidates. Maximal degree in co-relation 15195. Up to 2669 conditions per place. [2023-08-30 03:11:49,382 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 134 selfloop transitions, 4 changer transitions 4/169 dead transitions. [2023-08-30 03:11:49,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 169 transitions, 2222 flow [2023-08-30 03:11:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:11:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:11:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-30 03:11:49,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42386831275720166 [2023-08-30 03:11:49,385 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-30 03:11:49,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-30 03:11:49,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:49,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-30 03:11:49,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:49,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:49,387 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 324.0) internal successors, (1296), 4 states have internal predecessors, (1296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:49,387 INFO L175 Difference]: Start difference. First operand has 104 places, 165 transitions, 2150 flow. Second operand 3 states and 412 transitions. [2023-08-30 03:11:49,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 169 transitions, 2222 flow [2023-08-30 03:11:49,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 169 transitions, 2139 flow, removed 27 selfloop flow, removed 4 redundant places. [2023-08-30 03:11:49,457 INFO L231 Difference]: Finished difference. Result has 103 places, 139 transitions, 1598 flow [2023-08-30 03:11:49,457 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=1624, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1598, PETRI_PLACES=103, PETRI_TRANSITIONS=139} [2023-08-30 03:11:49,458 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 5 predicate places. [2023-08-30 03:11:49,458 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 139 transitions, 1598 flow [2023-08-30 03:11:49,458 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:49,458 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:49,458 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:49,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-30 03:11:49,459 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:49,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:49,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1286572609, now seen corresponding path program 1 times [2023-08-30 03:11:49,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:49,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386934503] [2023-08-30 03:11:49,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:49,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:51,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:51,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:51,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386934503] [2023-08-30 03:11:51,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386934503] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:51,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:51,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-30 03:11:51,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468132770] [2023-08-30 03:11:51,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:51,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-30 03:11:51,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:51,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-30 03:11:51,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-08-30 03:11:51,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 324 [2023-08-30 03:11:51,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 139 transitions, 1598 flow. Second operand has 10 states, 10 states have (on average 106.5) internal successors, (1065), 10 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:51,462 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:51,462 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 324 [2023-08-30 03:11:51,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:52,271 INFO L130 PetriNetUnfolder]: 1918/3413 cut-off events. [2023-08-30 03:11:52,271 INFO L131 PetriNetUnfolder]: For 13030/13069 co-relation queries the response was YES. [2023-08-30 03:11:52,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17042 conditions, 3413 events. 1918/3413 cut-off events. For 13030/13069 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 20985 event pairs, 512 based on Foata normal form. 17/3430 useless extension candidates. Maximal degree in co-relation 17011. Up to 3046 conditions per place. [2023-08-30 03:11:52,290 INFO L137 encePairwiseOnDemand]: 316/324 looper letters, 145 selfloop transitions, 33 changer transitions 4/184 dead transitions. [2023-08-30 03:11:52,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 184 transitions, 2234 flow [2023-08-30 03:11:52,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:11:52,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:11:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1135 transitions. [2023-08-30 03:11:52,292 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35030864197530864 [2023-08-30 03:11:52,292 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1135 transitions. [2023-08-30 03:11:52,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1135 transitions. [2023-08-30 03:11:52,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:52,293 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1135 transitions. [2023-08-30 03:11:52,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.5) internal successors, (1135), 10 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 324.0) internal successors, (3564), 11 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,297 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 324.0) internal successors, (3564), 11 states have internal predecessors, (3564), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,297 INFO L175 Difference]: Start difference. First operand has 103 places, 139 transitions, 1598 flow. Second operand 10 states and 1135 transitions. [2023-08-30 03:11:52,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 184 transitions, 2234 flow [2023-08-30 03:11:52,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 184 transitions, 2225 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:11:52,354 INFO L231 Difference]: Finished difference. Result has 113 places, 139 transitions, 1709 flow [2023-08-30 03:11:52,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=1594, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1709, PETRI_PLACES=113, PETRI_TRANSITIONS=139} [2023-08-30 03:11:52,355 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2023-08-30 03:11:52,355 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 139 transitions, 1709 flow [2023-08-30 03:11:52,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.5) internal successors, (1065), 10 states have internal predecessors, (1065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:52,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:52,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-30 03:11:52,356 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:52,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:52,356 INFO L85 PathProgramCache]: Analyzing trace with hash -2040746870, now seen corresponding path program 1 times [2023-08-30 03:11:52,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:52,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569195056] [2023-08-30 03:11:52,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:52,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:52,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:52,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569195056] [2023-08-30 03:11:52,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569195056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:52,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:52,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:11:52,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789446536] [2023-08-30 03:11:52,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:52,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:11:52,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:52,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:11:52,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:11:52,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:11:52,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 139 transitions, 1709 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:52,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:11:52,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:52,868 INFO L130 PetriNetUnfolder]: 431/911 cut-off events. [2023-08-30 03:11:52,868 INFO L131 PetriNetUnfolder]: For 4103/4128 co-relation queries the response was YES. [2023-08-30 03:11:52,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4285 conditions, 911 events. 431/911 cut-off events. For 4103/4128 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4641 event pairs, 84 based on Foata normal form. 75/981 useless extension candidates. Maximal degree in co-relation 4252. Up to 397 conditions per place. [2023-08-30 03:11:52,873 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 97 selfloop transitions, 7 changer transitions 15/134 dead transitions. [2023-08-30 03:11:52,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 134 transitions, 1614 flow [2023-08-30 03:11:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:11:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:11:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 546 transitions. [2023-08-30 03:11:52,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212962962962963 [2023-08-30 03:11:52,874 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 546 transitions. [2023-08-30 03:11:52,875 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 546 transitions. [2023-08-30 03:11:52,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:52,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 546 transitions. [2023-08-30 03:11:52,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.5) internal successors, (546), 4 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,877 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:52,877 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 324.0) internal successors, (1620), 5 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-30 03:11:52,877 INFO L175 Difference]: Start difference. First operand has 113 places, 139 transitions, 1709 flow. Second operand 4 states and 546 transitions. [2023-08-30 03:11:52,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 134 transitions, 1614 flow [2023-08-30 03:11:52,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 134 transitions, 1465 flow, removed 46 selfloop flow, removed 10 redundant places. [2023-08-30 03:11:52,888 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 814 flow [2023-08-30 03:11:52,889 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=814, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2023-08-30 03:11:52,889 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 3 predicate places. [2023-08-30 03:11:52,889 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 814 flow [2023-08-30 03:11:52,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:52,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:52,889 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:52,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-30 03:11:52,890 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:52,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:52,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2127002446, now seen corresponding path program 1 times [2023-08-30 03:11:52,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:52,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435713538] [2023-08-30 03:11:52,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:52,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:53,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:53,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435713538] [2023-08-30 03:11:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435713538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:53,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:11:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417616398] [2023-08-30 03:11:53,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:53,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:11:53,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:53,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:11:53,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:11:53,255 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 324 [2023-08-30 03:11:53,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 814 flow. Second operand has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:53,255 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:53,255 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 324 [2023-08-30 03:11:53,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:53,399 INFO L130 PetriNetUnfolder]: 290/563 cut-off events. [2023-08-30 03:11:53,399 INFO L131 PetriNetUnfolder]: For 2053/2077 co-relation queries the response was YES. [2023-08-30 03:11:53,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2520 conditions, 563 events. 290/563 cut-off events. For 2053/2077 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2501 event pairs, 71 based on Foata normal form. 25/583 useless extension candidates. Maximal degree in co-relation 2492. Up to 261 conditions per place. [2023-08-30 03:11:53,402 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 44 selfloop transitions, 10 changer transitions 29/89 dead transitions. [2023-08-30 03:11:53,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 89 transitions, 930 flow [2023-08-30 03:11:53,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:11:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:11:53,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-30 03:11:53,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.408641975308642 [2023-08-30 03:11:53,404 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-30 03:11:53,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-30 03:11:53,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:53,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-30 03:11:53,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:53,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:53,406 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 324.0) internal successors, (1944), 6 states have internal predecessors, (1944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:53,406 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 814 flow. Second operand 5 states and 662 transitions. [2023-08-30 03:11:53,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 89 transitions, 930 flow [2023-08-30 03:11:53,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 89 transitions, 780 flow, removed 13 selfloop flow, removed 21 redundant places. [2023-08-30 03:11:53,410 INFO L231 Difference]: Finished difference. Result has 70 places, 44 transitions, 325 flow [2023-08-30 03:11:53,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=70, PETRI_TRANSITIONS=44} [2023-08-30 03:11:53,411 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -28 predicate places. [2023-08-30 03:11:53,411 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 44 transitions, 325 flow [2023-08-30 03:11:53,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.6) internal successors, (628), 5 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:53,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:53,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:53,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-30 03:11:53,411 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:53,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:53,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1915928733, now seen corresponding path program 1 times [2023-08-30 03:11:53,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:53,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886018003] [2023-08-30 03:11:53,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:53,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:53,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:55,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886018003] [2023-08-30 03:11:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886018003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:55,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:55,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:11:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81219323] [2023-08-30 03:11:55,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:55,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:11:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:11:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:11:55,267 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 324 [2023-08-30 03:11:55,267 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 44 transitions, 325 flow. Second operand has 8 states, 8 states have (on average 119.625) internal successors, (957), 8 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:55,268 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:55,268 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 324 [2023-08-30 03:11:55,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:55,553 INFO L130 PetriNetUnfolder]: 369/717 cut-off events. [2023-08-30 03:11:55,553 INFO L131 PetriNetUnfolder]: For 1796/1796 co-relation queries the response was YES. [2023-08-30 03:11:55,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2947 conditions, 717 events. 369/717 cut-off events. For 1796/1796 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3412 event pairs, 112 based on Foata normal form. 1/718 useless extension candidates. Maximal degree in co-relation 2930. Up to 342 conditions per place. [2023-08-30 03:11:55,556 INFO L137 encePairwiseOnDemand]: 319/324 looper letters, 48 selfloop transitions, 7 changer transitions 31/87 dead transitions. [2023-08-30 03:11:55,556 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 87 transitions, 775 flow [2023-08-30 03:11:55,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-30 03:11:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-30 03:11:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 752 transitions. [2023-08-30 03:11:55,558 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3868312757201646 [2023-08-30 03:11:55,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 752 transitions. [2023-08-30 03:11:55,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 752 transitions. [2023-08-30 03:11:55,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:55,558 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 752 transitions. [2023-08-30 03:11:55,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.33333333333333) internal successors, (752), 6 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:55,560 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:55,560 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 324.0) internal successors, (2268), 7 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:55,561 INFO L175 Difference]: Start difference. First operand has 70 places, 44 transitions, 325 flow. Second operand 6 states and 752 transitions. [2023-08-30 03:11:55,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 87 transitions, 775 flow [2023-08-30 03:11:55,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 87 transitions, 651 flow, removed 20 selfloop flow, removed 11 redundant places. [2023-08-30 03:11:55,564 INFO L231 Difference]: Finished difference. Result has 63 places, 43 transitions, 298 flow [2023-08-30 03:11:55,565 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=63, PETRI_TRANSITIONS=43} [2023-08-30 03:11:55,565 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -35 predicate places. [2023-08-30 03:11:55,565 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 43 transitions, 298 flow [2023-08-30 03:11:55,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.625) internal successors, (957), 8 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:55,566 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:55,566 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:55,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-30 03:11:55,566 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:55,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:55,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1709320871, now seen corresponding path program 2 times [2023-08-30 03:11:55,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:55,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7205597] [2023-08-30 03:11:55,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:55,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:57,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:57,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:57,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7205597] [2023-08-30 03:11:57,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7205597] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:57,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:57,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-30 03:11:57,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6709529] [2023-08-30 03:11:57,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:57,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-30 03:11:57,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:57,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-30 03:11:57,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-08-30 03:11:57,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 324 [2023-08-30 03:11:57,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 43 transitions, 298 flow. Second operand has 11 states, 11 states have (on average 105.9090909090909) internal successors, (1165), 11 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:57,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:57,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 324 [2023-08-30 03:11:57,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:57,965 INFO L130 PetriNetUnfolder]: 188/392 cut-off events. [2023-08-30 03:11:57,966 INFO L131 PetriNetUnfolder]: For 998/1004 co-relation queries the response was YES. [2023-08-30 03:11:57,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1594 conditions, 392 events. 188/392 cut-off events. For 998/1004 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1654 event pairs, 69 based on Foata normal form. 4/396 useless extension candidates. Maximal degree in co-relation 1579. Up to 181 conditions per place. [2023-08-30 03:11:57,968 INFO L137 encePairwiseOnDemand]: 318/324 looper letters, 31 selfloop transitions, 4 changer transitions 38/74 dead transitions. [2023-08-30 03:11:57,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 74 transitions, 614 flow [2023-08-30 03:11:57,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-30 03:11:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-30 03:11:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 882 transitions. [2023-08-30 03:11:57,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3402777777777778 [2023-08-30 03:11:57,974 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 882 transitions. [2023-08-30 03:11:57,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 882 transitions. [2023-08-30 03:11:57,975 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:57,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 882 transitions. [2023-08-30 03:11:57,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.25) internal successors, (882), 8 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:57,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:57,978 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 324.0) internal successors, (2916), 9 states have internal predecessors, (2916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:57,978 INFO L175 Difference]: Start difference. First operand has 63 places, 43 transitions, 298 flow. Second operand 8 states and 882 transitions. [2023-08-30 03:11:57,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 74 transitions, 614 flow [2023-08-30 03:11:57,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 74 transitions, 588 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-30 03:11:57,981 INFO L231 Difference]: Finished difference. Result has 66 places, 30 transitions, 181 flow [2023-08-30 03:11:57,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=181, PETRI_PLACES=66, PETRI_TRANSITIONS=30} [2023-08-30 03:11:57,981 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -32 predicate places. [2023-08-30 03:11:57,982 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 30 transitions, 181 flow [2023-08-30 03:11:57,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 105.9090909090909) internal successors, (1165), 11 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:57,982 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:57,982 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:57,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-30 03:11:57,982 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:57,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:57,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1757403649, now seen corresponding path program 3 times [2023-08-30 03:11:57,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:57,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220078896] [2023-08-30 03:11:57,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:57,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:11:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:11:59,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 03:11:59,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220078896] [2023-08-30 03:11:59,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220078896] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:11:59,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:11:59,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:11:59,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896300694] [2023-08-30 03:11:59,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:11:59,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:11:59,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 03:11:59,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:11:59,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:11:59,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 324 [2023-08-30 03:11:59,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 30 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:59,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:11:59,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 324 [2023-08-30 03:11:59,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:11:59,550 INFO L130 PetriNetUnfolder]: 87/185 cut-off events. [2023-08-30 03:11:59,550 INFO L131 PetriNetUnfolder]: For 562/568 co-relation queries the response was YES. [2023-08-30 03:11:59,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 803 conditions, 185 events. 87/185 cut-off events. For 562/568 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 628 event pairs, 15 based on Foata normal form. 3/188 useless extension candidates. Maximal degree in co-relation 787. Up to 99 conditions per place. [2023-08-30 03:11:59,551 INFO L137 encePairwiseOnDemand]: 318/324 looper letters, 29 selfloop transitions, 5 changer transitions 21/56 dead transitions. [2023-08-30 03:11:59,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 56 transitions, 440 flow [2023-08-30 03:11:59,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:11:59,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:11:59,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 857 transitions. [2023-08-30 03:11:59,553 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37786596119929455 [2023-08-30 03:11:59,553 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 857 transitions. [2023-08-30 03:11:59,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 857 transitions. [2023-08-30 03:11:59,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:11:59,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 857 transitions. [2023-08-30 03:11:59,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.42857142857143) internal successors, (857), 7 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:59,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:59,556 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 324.0) internal successors, (2592), 8 states have internal predecessors, (2592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:59,557 INFO L175 Difference]: Start difference. First operand has 66 places, 30 transitions, 181 flow. Second operand 7 states and 857 transitions. [2023-08-30 03:11:59,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 56 transitions, 440 flow [2023-08-30 03:11:59,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 389 flow, removed 6 selfloop flow, removed 16 redundant places. [2023-08-30 03:11:59,558 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 154 flow [2023-08-30 03:11:59,558 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=324, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=154, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-08-30 03:11:59,559 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -46 predicate places. [2023-08-30 03:11:59,559 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 154 flow [2023-08-30 03:11:59,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:11:59,559 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:11:59,559 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:59,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-30 03:11:59,559 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:11:59,560 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:11:59,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1649536997, now seen corresponding path program 4 times [2023-08-30 03:11:59,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 03:11:59,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833514671] [2023-08-30 03:11:59,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:11:59,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 03:11:59,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:11:59,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:11:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:11:59,751 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-30 03:11:59,751 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:11:59,752 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-08-30 03:11:59,754 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-08-30 03:11:59,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-08-30 03:11:59,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-08-30 03:11:59,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-08-30 03:11:59,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-08-30 03:11:59,755 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-08-30 03:11:59,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-08-30 03:11:59,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-08-30 03:11:59,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-08-30 03:11:59,756 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-08-30 03:11:59,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-08-30 03:11:59,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-08-30 03:11:59,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-08-30 03:11:59,757 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-08-30 03:11:59,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-08-30 03:11:59,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-08-30 03:11:59,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-08-30 03:11:59,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-08-30 03:11:59,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-08-30 03:11:59,758 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-08-30 03:11:59,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-08-30 03:11:59,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-08-30 03:11:59,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-08-30 03:11:59,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-08-30 03:11:59,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-08-30 03:11:59,759 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-08-30 03:11:59,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-08-30 03:11:59,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-08-30 03:11:59,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-08-30 03:11:59,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-08-30 03:11:59,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-08-30 03:11:59,760 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-08-30 03:11:59,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-08-30 03:11:59,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-08-30 03:11:59,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-08-30 03:11:59,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-08-30 03:11:59,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-08-30 03:11:59,761 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-08-30 03:11:59,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-08-30 03:11:59,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-08-30 03:11:59,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-08-30 03:11:59,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-08-30 03:11:59,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-08-30 03:11:59,762 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-08-30 03:11:59,763 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-08-30 03:11:59,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-08-30 03:11:59,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-08-30 03:11:59,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-08-30 03:11:59,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-08-30 03:11:59,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-08-30 03:11:59,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-08-30 03:11:59,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-08-30 03:11:59,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-08-30 03:11:59,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-08-30 03:11:59,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-08-30 03:11:59,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-08-30 03:11:59,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-08-30 03:11:59,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-08-30 03:11:59,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-08-30 03:11:59,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-08-30 03:11:59,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-08-30 03:11:59,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-08-30 03:11:59,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-08-30 03:11:59,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-08-30 03:11:59,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-08-30 03:11:59,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-08-30 03:11:59,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-08-30 03:11:59,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-08-30 03:11:59,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-08-30 03:11:59,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-08-30 03:11:59,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-08-30 03:11:59,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-08-30 03:11:59,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-08-30 03:11:59,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-08-30 03:11:59,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-08-30 03:11:59,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-08-30 03:11:59,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-08-30 03:11:59,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-08-30 03:11:59,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-08-30 03:11:59,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-08-30 03:11:59,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-08-30 03:11:59,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-08-30 03:11:59,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-08-30 03:11:59,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-08-30 03:11:59,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-08-30 03:11:59,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-08-30 03:11:59,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-08-30 03:11:59,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-08-30 03:11:59,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-30 03:11:59,772 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:11:59,777 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:11:59,778 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:11:59,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:11:59 BasicIcfg [2023-08-30 03:11:59,848 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:11:59,848 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:11:59,848 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:11:59,849 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:11:59,849 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:10:45" (3/4) ... [2023-08-30 03:11:59,851 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:11:59,851 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:11:59,852 INFO L158 Benchmark]: Toolchain (without parser) took 76299.49ms. Allocated memory was 71.3MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 46.8MB in the beginning and 4.4GB in the end (delta: -4.4GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 03:11:59,852 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:11:59,852 INFO L158 Benchmark]: CACSL2BoogieTranslator took 546.13ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 46.6MB in the beginning and 60.4MB in the end (delta: -13.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-08-30 03:11:59,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.10ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 57.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:11:59,853 INFO L158 Benchmark]: Boogie Preprocessor took 67.04ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 55.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-30 03:11:59,853 INFO L158 Benchmark]: RCFGBuilder took 1443.42ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 74.0MB in the end (delta: -18.9MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2023-08-30 03:11:59,854 INFO L158 Benchmark]: TraceAbstraction took 74154.20ms. Allocated memory was 111.1MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 72.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-30 03:11:59,854 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 5.5GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:11:59,855 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 71.3MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 546.13ms. Allocated memory was 71.3MB in the beginning and 92.3MB in the end (delta: 21.0MB). Free memory was 46.6MB in the beginning and 60.4MB in the end (delta: -13.7MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.10ms. Allocated memory is still 92.3MB. Free memory was 60.4MB in the beginning and 57.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.04ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 55.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1443.42ms. Allocated memory was 92.3MB in the beginning and 111.1MB in the end (delta: 18.9MB). Free memory was 55.1MB in the beginning and 74.0MB in the end (delta: -18.9MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * TraceAbstraction took 74154.20ms. Allocated memory was 111.1MB in the beginning and 5.5GB in the end (delta: 5.4GB). Free memory was 72.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 5.5GB. Free memory is still 4.4GB. 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: 18.3s, 193 PlacesBefore, 98 PlacesAfterwards, 185 TransitionsBefore, 89 TransitionsAfterwards, 8576 CoEnabledTransitionPairs, 8 FixpointIterations, 63 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 136 TotalNumberOfCompositions, 63604 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12423, independent: 11434, independent conditional: 0, independent unconditional: 11434, dependent: 989, dependent conditional: 0, dependent unconditional: 989, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3090, independent: 2953, independent conditional: 0, independent unconditional: 2953, dependent: 137, dependent conditional: 0, dependent unconditional: 137, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12423, independent: 8481, independent conditional: 0, independent unconditional: 8481, dependent: 852, dependent conditional: 0, dependent unconditional: 852, unknown: 3090, unknown conditional: 0, unknown unconditional: 3090] , Statistics on independence cache: Total cache size (in pairs): 523, Positive cache size: 429, Positive conditional cache size: 0, Positive unconditional cache size: 429, Negative cache size: 94, Negative conditional cache size: 0, Negative unconditional cache size: 94, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2133; [L853] FCALL, FORK 0 pthread_create(&t2133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2133, ((void *)0), P0, ((void *)0))=0, t2133={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 pthread_t t2134; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, t2134={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] FCALL, FORK 0 pthread_create(&t2134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2134, ((void *)0), P1, ((void *)0))=1, t2133={7:0}, t2134={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 pthread_t t2135; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] FCALL, FORK 0 pthread_create(&t2135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2135, ((void *)0), P2, ((void *)0))=2, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L792] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2133={7:0}, t2134={8:0}, t2135={5:0}, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 249 locations, 101 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: 73.9s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 18.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3005 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2281 mSDsluCounter, 1230 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1090 mSDsCounter, 749 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7064 IncrementalHoareTripleChecker+Invalid, 7813 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 749 mSolverCounterUnsat, 140 mSDtfsCounter, 7064 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2310occurred in iteration=14, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 15.8s InterpolantComputationTime, 344 NumberOfCodeBlocks, 344 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 298 ConstructedInterpolants, 0 QuantifiedInterpolants, 4320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:11:59,892 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/safe015_rmo.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 fa1630ab5b9ca06d45588653daa6fff0d3a2fbd0851a9f5c3999782c5c51eba5 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 03:12:02,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 03:12:02,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 03:12:02,203 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 03:12:02,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 03:12:02,208 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 03:12:02,210 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 03:12:02,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 03:12:02,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 03:12:02,219 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 03:12:02,220 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 03:12:02,220 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 03:12:02,221 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 03:12:02,221 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 03:12:02,222 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 03:12:02,223 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 03:12:02,224 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 03:12:02,224 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 03:12:02,225 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 03:12:02,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 03:12:02,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 03:12:02,229 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 03:12:02,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 03:12:02,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 03:12:02,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 03:12:02,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 03:12:02,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 03:12:02,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 03:12:02,235 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 03:12:02,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 03:12:02,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 03:12:02,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 03:12:02,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 03:12:02,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 03:12:02,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 03:12:02,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 03:12:02,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 03:12:02,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 03:12:02,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 03:12:02,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 03:12:02,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 03:12:02,243 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-30 03:12:02,282 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 03:12:02,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 03:12:02,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 03:12:02,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 03:12:02,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 03:12:02,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 03:12:02,287 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 03:12:02,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 03:12:02,287 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 03:12:02,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 03:12:02,288 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 03:12:02,289 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 03:12:02,289 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 03:12:02,289 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 03:12:02,289 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 03:12:02,289 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 03:12:02,289 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 03:12:02,290 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 03:12:02,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 03:12:02,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 03:12:02,291 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 03:12:02,291 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:12:02,291 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 03:12:02,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 03:12:02,292 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-30 03:12:02,292 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-30 03:12:02,292 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 03:12:02,292 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 03:12:02,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 03:12:02,293 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-30 03:12:02,293 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 03:12:02,293 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 -> fa1630ab5b9ca06d45588653daa6fff0d3a2fbd0851a9f5c3999782c5c51eba5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> TOGETHER [2023-08-30 03:12:02,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 03:12:02,591 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 03:12:02,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 03:12:02,595 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 03:12:02,596 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 03:12:02,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-08-30 03:12:03,898 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 03:12:04,136 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 03:12:04,137 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-08-30 03:12:04,151 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aace1771b/05df48aa0ce846d397f2525d92f165fd/FLAG4be312899 [2023-08-30 03:12:04,166 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aace1771b/05df48aa0ce846d397f2525d92f165fd [2023-08-30 03:12:04,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 03:12:04,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 03:12:04,171 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 03:12:04,171 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 03:12:04,174 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 03:12:04,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78f519cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04, skipping insertion in model container [2023-08-30 03:12:04,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,181 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 03:12:04,224 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 03:12:04,362 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/safe015_rmo.i[988,1001] [2023-08-30 03:12:04,602 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:12:04,619 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 03:12:04,634 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_rmo.i[988,1001] [2023-08-30 03:12:04,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 03:12:04,750 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:12:04,751 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-30 03:12:04,756 INFO L208 MainTranslator]: Completed translation [2023-08-30 03:12:04,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04 WrapperNode [2023-08-30 03:12:04,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 03:12:04,759 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 03:12:04,759 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 03:12:04,759 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 03:12:04,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,800 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,838 INFO L138 Inliner]: procedures = 180, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 170 [2023-08-30 03:12:04,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 03:12:04,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 03:12:04,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 03:12:04,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 03:12:04,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,878 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,908 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 03:12:04,917 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 03:12:04,917 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 03:12:04,917 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 03:12:04,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (1/1) ... [2023-08-30 03:12:04,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 03:12:04,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 03:12:04,950 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 03:12:04,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 03:12:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-30 03:12:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-30 03:12:04,985 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 03:12:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 03:12:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 03:12:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-30 03:12:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-30 03:12:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-30 03:12:04,986 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-30 03:12:04,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-30 03:12:04,987 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-30 03:12:04,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-30 03:12:04,987 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-30 03:12:04,987 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-30 03:12:04,987 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-30 03:12:04,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 03:12:04,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 03:12:04,989 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 03:12:05,190 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 03:12:05,191 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 03:12:05,783 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 03:12:06,484 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 03:12:06,484 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-30 03:12:06,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:12:06 BoogieIcfgContainer [2023-08-30 03:12:06,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 03:12:06,491 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 03:12:06,491 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 03:12:06,494 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 03:12:06,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 03:12:04" (1/3) ... [2023-08-30 03:12:06,495 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfe6c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:12:06, skipping insertion in model container [2023-08-30 03:12:06,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 03:12:04" (2/3) ... [2023-08-30 03:12:06,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bfe6c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 03:12:06, skipping insertion in model container [2023-08-30 03:12:06,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:12:06" (3/3) ... [2023-08-30 03:12:06,497 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_rmo.i [2023-08-30 03:12:06,513 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 03:12:06,514 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-08-30 03:12:06,514 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 03:12:06,687 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-30 03:12:06,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 189 transitions, 393 flow [2023-08-30 03:12:06,790 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2023-08-30 03:12:06,790 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:06,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 345 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-30 03:12:06,797 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 189 transitions, 393 flow [2023-08-30 03:12:06,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 194 places, 186 transitions, 381 flow [2023-08-30 03:12:06,806 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 03:12:06,860 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 194 places, 186 transitions, 381 flow [2023-08-30 03:12:06,863 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 194 places, 186 transitions, 381 flow [2023-08-30 03:12:06,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 194 places, 186 transitions, 381 flow [2023-08-30 03:12:06,978 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2023-08-30 03:12:06,985 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:06,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 353 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2023-08-30 03:12:06,993 INFO L119 LiptonReduction]: Number of co-enabled transitions 8576 [2023-08-30 03:12:48,615 INFO L134 LiptonReduction]: Checked pairs total: 62906 [2023-08-30 03:12:48,616 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-30 03:12:48,632 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 03:12:48,637 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;@747c0c84, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 03:12:48,637 INFO L358 AbstractCegarLoop]: Starting to check reachability of 101 error locations. [2023-08-30 03:12:48,639 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-30 03:12:48,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:48,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:12:48,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 03:12:48,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:12:48,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:12:48,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1168, now seen corresponding path program 1 times [2023-08-30 03:12:48,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:12:48,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9437771] [2023-08-30 03:12:48,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:12:48,656 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:12:48,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:12:48,659 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:12:48,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-30 03:12:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:12:48,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-30 03:12:48,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:12:48,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:12:48,778 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:12:48,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:12:48,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9437771] [2023-08-30 03:12:48,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9437771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:12:48,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:12:48,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 03:12:48,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009374677] [2023-08-30 03:12:48,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:12:48,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 03:12:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:12:48,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 03:12:48,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 03:12:48,811 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 326 [2023-08-30 03:12:48,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 89 transitions, 187 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-30 03:12:48,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:12:48,813 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 326 [2023-08-30 03:12:48,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:12:54,701 INFO L130 PetriNetUnfolder]: 28168/39305 cut-off events. [2023-08-30 03:12:54,702 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-30 03:12:54,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78611 conditions, 39305 events. 28168/39305 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 3080. Compared 278510 event pairs, 28168 based on Foata normal form. 600/16253 useless extension candidates. Maximal degree in co-relation 78600. Up to 39168 conditions per place. [2023-08-30 03:12:54,995 INFO L137 encePairwiseOnDemand]: 289/326 looper letters, 48 selfloop transitions, 0 changer transitions 0/52 dead transitions. [2023-08-30 03:12:54,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 52 transitions, 209 flow [2023-08-30 03:12:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 03:12:55,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 03:12:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 339 transitions. [2023-08-30 03:12:55,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5199386503067485 [2023-08-30 03:12:55,014 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 339 transitions. [2023-08-30 03:12:55,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 339 transitions. [2023-08-30 03:12:55,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:12:55,020 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 339 transitions. [2023-08-30 03:12:55,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 169.5) internal successors, (339), 2 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:55,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:55,030 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 326.0) internal successors, (978), 3 states have internal predecessors, (978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:55,033 INFO L175 Difference]: Start difference. First operand has 98 places, 89 transitions, 187 flow. Second operand 2 states and 339 transitions. [2023-08-30 03:12:55,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 52 transitions, 209 flow [2023-08-30 03:12:55,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 52 transitions, 206 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-30 03:12:55,045 INFO L231 Difference]: Finished difference. Result has 60 places, 52 transitions, 110 flow [2023-08-30 03:12:55,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=52} [2023-08-30 03:12:55,052 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -38 predicate places. [2023-08-30 03:12:55,052 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 52 transitions, 110 flow [2023-08-30 03:12:55,052 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-30 03:12:55,053 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:12:55,053 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:12:55,066 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-30 03:12:55,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:12:55,261 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:12:55,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:12:55,262 INFO L85 PathProgramCache]: Analyzing trace with hash 35851823, now seen corresponding path program 1 times [2023-08-30 03:12:55,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:12:55,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1533922750] [2023-08-30 03:12:55,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:12:55,263 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:12:55,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:12:55,268 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:12:55,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-30 03:12:55,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:12:55,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:12:55,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:12:55,467 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-30 03:12:55,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-30 03:12:55,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:12:55,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:12:55,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:12:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1533922750] [2023-08-30 03:12:55,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1533922750] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:12:55,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:12:55,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:12:55,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138489243] [2023-08-30 03:12:55,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:12:55,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:12:55,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:12:55,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:12:55,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:12:55,622 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 326 [2023-08-30 03:12:55,623 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 52 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:55,623 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:12:55,623 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 326 [2023-08-30 03:12:55,623 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:12:58,728 INFO L130 PetriNetUnfolder]: 13279/18815 cut-off events. [2023-08-30 03:12:58,728 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 03:12:58,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37635 conditions, 18815 events. 13279/18815 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 122219 event pairs, 8495 based on Foata normal form. 400/9903 useless extension candidates. Maximal degree in co-relation 37632. Up to 9534 conditions per place. [2023-08-30 03:12:58,835 INFO L137 encePairwiseOnDemand]: 313/326 looper letters, 60 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-30 03:12:58,836 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 65 transitions, 260 flow [2023-08-30 03:12:58,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:12:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:12:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-30 03:12:58,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4488752556237219 [2023-08-30 03:12:58,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-30 03:12:58,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-30 03:12:58,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:12:58,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-30 03:12:58,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:58,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:58,846 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:58,846 INFO L175 Difference]: Start difference. First operand has 60 places, 52 transitions, 110 flow. Second operand 3 states and 439 transitions. [2023-08-30 03:12:58,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 65 transitions, 260 flow [2023-08-30 03:12:58,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 260 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 03:12:58,848 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 126 flow [2023-08-30 03:12:58,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-30 03:12:58,849 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -38 predicate places. [2023-08-30 03:12:58,849 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 126 flow [2023-08-30 03:12:58,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:58,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:12:58,851 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-30 03:12:58,863 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-08-30 03:12:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:12:59,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:12:59,060 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:12:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 35851824, now seen corresponding path program 1 times [2023-08-30 03:12:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:12:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1756276033] [2023-08-30 03:12:59,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:12:59,061 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:12:59,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:12:59,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:12:59,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-30 03:12:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:12:59,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:12:59,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:12:59,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-30 03:12:59,209 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-30 03:12:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:12:59,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:12:59,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:12:59,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1756276033] [2023-08-30 03:12:59,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1756276033] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:12:59,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:12:59,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 03:12:59,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955512532] [2023-08-30 03:12:59,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:12:59,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:12:59,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:12:59,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:12:59,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:12:59,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 326 [2023-08-30 03:12:59,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:12:59,305 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:12:59,305 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 326 [2023-08-30 03:12:59,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:12:59,991 INFO L130 PetriNetUnfolder]: 3567/5244 cut-off events. [2023-08-30 03:12:59,992 INFO L131 PetriNetUnfolder]: For 566/636 co-relation queries the response was YES. [2023-08-30 03:12:59,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11765 conditions, 5244 events. 3567/5244 cut-off events. For 566/636 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 29393 event pairs, 3567 based on Foata normal form. 280/4647 useless extension candidates. Maximal degree in co-relation 11760. Up to 5162 conditions per place. [2023-08-30 03:13:00,020 INFO L137 encePairwiseOnDemand]: 314/326 looper letters, 33 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2023-08-30 03:13:00,020 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 174 flow [2023-08-30 03:13:00,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:00,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:00,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-30 03:13:00,022 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43047034764826175 [2023-08-30 03:13:00,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-30 03:13:00,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-30 03:13:00,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:00,023 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-30 03:13:00,024 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,027 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 126 flow. Second operand 3 states and 421 transitions. [2023-08-30 03:13:00,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 174 flow [2023-08-30 03:13:00,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:00,030 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 100 flow [2023-08-30 03:13:00,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-30 03:13:00,031 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -49 predicate places. [2023-08-30 03:13:00,031 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 100 flow [2023-08-30 03:13:00,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:00,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:00,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:00,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:00,241 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:00,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:00,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1296183123, now seen corresponding path program 1 times [2023-08-30 03:13:00,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:00,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989484005] [2023-08-30 03:13:00,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:00,242 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:00,243 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:00,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:00,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-30 03:13:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:00,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:13:00,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:00,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:00,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989484005] [2023-08-30 03:13:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989484005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:00,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-30 03:13:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913582524] [2023-08-30 03:13:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:00,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 03:13:00,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 03:13:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 03:13:00,402 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 326 [2023-08-30 03:13:00,403 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,403 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:00,403 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 326 [2023-08-30 03:13:00,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:00,858 INFO L130 PetriNetUnfolder]: 1226/2012 cut-off events. [2023-08-30 03:13:00,858 INFO L131 PetriNetUnfolder]: For 156/176 co-relation queries the response was YES. [2023-08-30 03:13:00,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4429 conditions, 2012 events. 1226/2012 cut-off events. For 156/176 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 11059 event pairs, 475 based on Foata normal form. 27/1721 useless extension candidates. Maximal degree in co-relation 4424. Up to 1851 conditions per place. [2023-08-30 03:13:00,867 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 45 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-30 03:13:00,867 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 52 transitions, 232 flow [2023-08-30 03:13:00,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 03:13:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 03:13:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2023-08-30 03:13:00,869 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4284253578732106 [2023-08-30 03:13:00,869 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 419 transitions. [2023-08-30 03:13:00,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 419 transitions. [2023-08-30 03:13:00,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:00,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 419 transitions. [2023-08-30 03:13:00,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.66666666666666) internal successors, (419), 3 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,872 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,873 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 326.0) internal successors, (1304), 4 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,873 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 100 flow. Second operand 3 states and 419 transitions. [2023-08-30 03:13:00,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 52 transitions, 232 flow [2023-08-30 03:13:00,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 52 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:00,874 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 125 flow [2023-08-30 03:13:00,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=99, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2023-08-30 03:13:00,875 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -48 predicate places. [2023-08-30 03:13:00,875 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 125 flow [2023-08-30 03:13:00,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:00,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:00,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:00,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:01,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:01,081 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:01,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:01,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1549333728, now seen corresponding path program 1 times [2023-08-30 03:13:01,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:01,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845157522] [2023-08-30 03:13:01,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:01,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:01,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:01,084 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:01,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-30 03:13:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:01,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:13:01,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:01,252 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:01,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:01,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845157522] [2023-08-30 03:13:01,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845157522] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:01,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:01,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309985322] [2023-08-30 03:13:01,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:01,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:01,273 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 326 [2023-08-30 03:13:01,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 125 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-30 03:13:01,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:01,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 326 [2023-08-30 03:13:01,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:01,595 INFO L130 PetriNetUnfolder]: 273/539 cut-off events. [2023-08-30 03:13:01,596 INFO L131 PetriNetUnfolder]: For 75/77 co-relation queries the response was YES. [2023-08-30 03:13:01,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1317 conditions, 539 events. 273/539 cut-off events. For 75/77 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2325 event pairs, 101 based on Foata normal form. 27/507 useless extension candidates. Maximal degree in co-relation 1311. Up to 276 conditions per place. [2023-08-30 03:13:01,598 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 54 selfloop transitions, 7 changer transitions 0/64 dead transitions. [2023-08-30 03:13:01,598 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 64 transitions, 307 flow [2023-08-30 03:13:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:01,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-08-30 03:13:01,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42484662576687116 [2023-08-30 03:13:01,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-08-30 03:13:01,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-08-30 03:13:01,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:01,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-08-30 03:13:01,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:01,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:01,606 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:01,606 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 125 flow. Second operand 4 states and 554 transitions. [2023-08-30 03:13:01,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 64 transitions, 307 flow [2023-08-30 03:13:01,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 64 transitions, 303 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:01,610 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 161 flow [2023-08-30 03:13:01,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=161, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-08-30 03:13:01,614 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -45 predicate places. [2023-08-30 03:13:01,614 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 161 flow [2023-08-30 03:13:01,614 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-30 03:13:01,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:01,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:01,627 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 (6)] Ended with exit code 0 [2023-08-30 03:13:01,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:01,824 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:01,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:01,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1529277767, now seen corresponding path program 1 times [2023-08-30 03:13:01,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:01,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153488430] [2023-08-30 03:13:01,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:01,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:01,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:01,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:01,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-08-30 03:13:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:01,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 03:13:01,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:02,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:02,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:02,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:02,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153488430] [2023-08-30 03:13:02,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [153488430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:02,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:02,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:02,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131309239] [2023-08-30 03:13:02,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:02,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:02,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:02,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:02,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:02,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 326 [2023-08-30 03:13:02,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 161 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:02,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 326 [2023-08-30 03:13:02,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:02,482 INFO L130 PetriNetUnfolder]: 162/309 cut-off events. [2023-08-30 03:13:02,482 INFO L131 PetriNetUnfolder]: For 243/243 co-relation queries the response was YES. [2023-08-30 03:13:02,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 309 events. 162/309 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1135 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 828. Up to 134 conditions per place. [2023-08-30 03:13:02,483 INFO L137 encePairwiseOnDemand]: 321/326 looper letters, 43 selfloop transitions, 10 changer transitions 1/56 dead transitions. [2023-08-30 03:13:02,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 285 flow [2023-08-30 03:13:02,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-30 03:13:02,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4110429447852761 [2023-08-30 03:13:02,486 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-30 03:13:02,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-30 03:13:02,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:02,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-30 03:13:02,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,492 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,493 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 161 flow. Second operand 5 states and 670 transitions. [2023-08-30 03:13:02,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 285 flow [2023-08-30 03:13:02,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 269 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:02,495 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 139 flow [2023-08-30 03:13:02,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 03:13:02,496 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2023-08-30 03:13:02,496 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 139 flow [2023-08-30 03:13:02,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,497 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:02,497 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:02,510 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 (7)] Ended with exit code 0 [2023-08-30 03:13:02,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:02,707 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:02,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:02,708 INFO L85 PathProgramCache]: Analyzing trace with hash -916351512, now seen corresponding path program 1 times [2023-08-30 03:13:02,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:02,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971896180] [2023-08-30 03:13:02,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:02,709 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:02,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:02,710 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:02,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-08-30 03:13:02,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:02,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-30 03:13:02,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:02,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:02,935 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:02,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:02,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971896180] [2023-08-30 03:13:02,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971896180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:02,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:02,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:02,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456119374] [2023-08-30 03:13:02,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:02,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:02,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:02,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:02,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:02,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 326 [2023-08-30 03:13:02,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:02,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:02,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 326 [2023-08-30 03:13:02,945 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:03,230 INFO L130 PetriNetUnfolder]: 225/423 cut-off events. [2023-08-30 03:13:03,230 INFO L131 PetriNetUnfolder]: For 496/496 co-relation queries the response was YES. [2023-08-30 03:13:03,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1214 conditions, 423 events. 225/423 cut-off events. For 496/496 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1628 event pairs, 86 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 1207. Up to 168 conditions per place. [2023-08-30 03:13:03,232 INFO L137 encePairwiseOnDemand]: 322/326 looper letters, 60 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2023-08-30 03:13:03,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 407 flow [2023-08-30 03:13:03,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:03,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 542 transitions. [2023-08-30 03:13:03,234 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4156441717791411 [2023-08-30 03:13:03,234 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 542 transitions. [2023-08-30 03:13:03,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 542 transitions. [2023-08-30 03:13:03,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:03,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 542 transitions. [2023-08-30 03:13:03,236 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-30 03:13:03,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,239 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,239 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 139 flow. Second operand 4 states and 542 transitions. [2023-08-30 03:13:03,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 407 flow [2023-08-30 03:13:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 64 transitions, 351 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:03,242 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 127 flow [2023-08-30 03:13:03,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2023-08-30 03:13:03,243 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2023-08-30 03:13:03,243 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 127 flow [2023-08-30 03:13:03,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:03,244 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:03,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:03,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:03,455 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:03,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:03,455 INFO L85 PathProgramCache]: Analyzing trace with hash -707646267, now seen corresponding path program 1 times [2023-08-30 03:13:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [527356958] [2023-08-30 03:13:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:03,456 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:03,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:03,457 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:03,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-08-30 03:13:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:03,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-30 03:13:03,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:03,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:03,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:03,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:03,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [527356958] [2023-08-30 03:13:03,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [527356958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:03,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:03,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:03,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112317254] [2023-08-30 03:13:03,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:03,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 03:13:03,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:03,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 03:13:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-30 03:13:03,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 326 [2023-08-30 03:13:03,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:03,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 326 [2023-08-30 03:13:03,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:03,911 INFO L130 PetriNetUnfolder]: 263/496 cut-off events. [2023-08-30 03:13:03,911 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2023-08-30 03:13:03,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1381 conditions, 496 events. 263/496 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1841 event pairs, 135 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 1373. Up to 263 conditions per place. [2023-08-30 03:13:03,913 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 40 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-30 03:13:03,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 245 flow [2023-08-30 03:13:03,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:03,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 506 transitions. [2023-08-30 03:13:03,915 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3880368098159509 [2023-08-30 03:13:03,915 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 506 transitions. [2023-08-30 03:13:03,915 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 506 transitions. [2023-08-30 03:13:03,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:03,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 506 transitions. [2023-08-30 03:13:03,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 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-30 03:13:03,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,919 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 127 flow. Second operand 4 states and 506 transitions. [2023-08-30 03:13:03,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 245 flow [2023-08-30 03:13:03,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:03,922 INFO L231 Difference]: Finished difference. Result has 47 places, 34 transitions, 125 flow [2023-08-30 03:13:03,922 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=47, PETRI_TRANSITIONS=34} [2023-08-30 03:13:03,923 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2023-08-30 03:13:03,923 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 34 transitions, 125 flow [2023-08-30 03:13:03,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:03,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:03,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:03,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:04,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:04,134 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:04,135 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2080867874, now seen corresponding path program 1 times [2023-08-30 03:13:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:04,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500841304] [2023-08-30 03:13:04,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 03:13:04,136 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:04,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:04,137 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:04,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-08-30 03:13:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:04,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-30 03:13:04,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:04,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:04,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:04,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500841304] [2023-08-30 03:13:04,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500841304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:04,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 03:13:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110465929] [2023-08-30 03:13:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:04,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-30 03:13:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:04,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-30 03:13:04,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-30 03:13:04,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 326 [2023-08-30 03:13:04,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 34 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:04,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 326 [2023-08-30 03:13:04,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:04,642 INFO L130 PetriNetUnfolder]: 263/494 cut-off events. [2023-08-30 03:13:04,642 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2023-08-30 03:13:04,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1364 conditions, 494 events. 263/494 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1832 event pairs, 135 based on Foata normal form. 0/494 useless extension candidates. Maximal degree in co-relation 1356. Up to 267 conditions per place. [2023-08-30 03:13:04,645 INFO L137 encePairwiseOnDemand]: 323/326 looper letters, 39 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-08-30 03:13:04,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 241 flow [2023-08-30 03:13:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-30 03:13:04,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-30 03:13:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 517 transitions. [2023-08-30 03:13:04,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3964723926380368 [2023-08-30 03:13:04,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 517 transitions. [2023-08-30 03:13:04,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 517 transitions. [2023-08-30 03:13:04,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:04,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 517 transitions. [2023-08-30 03:13:04,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.25) internal successors, (517), 4 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,651 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 326.0) internal successors, (1630), 5 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,651 INFO L175 Difference]: Start difference. First operand has 47 places, 34 transitions, 125 flow. Second operand 4 states and 517 transitions. [2023-08-30 03:13:04,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 241 flow [2023-08-30 03:13:04,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:04,654 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 124 flow [2023-08-30 03:13:04,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=124, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2023-08-30 03:13:04,655 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -51 predicate places. [2023-08-30 03:13:04,655 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 124 flow [2023-08-30 03:13:04,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:04,655 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:04,655 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:04,671 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:04,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:04,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:04,866 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash -827210218, now seen corresponding path program 2 times [2023-08-30 03:13:04,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:04,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439641353] [2023-08-30 03:13:04,867 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:13:04,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:04,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:04,868 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:04,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-08-30 03:13:05,060 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:13:05,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:05,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-30 03:13:05,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:05,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2023-08-30 03:13:06,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2023-08-30 03:13:06,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:13:06,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:13:06,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:06,745 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:06,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:06,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439641353] [2023-08-30 03:13:06,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439641353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:06,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:06,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:06,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262337246] [2023-08-30 03:13:06,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:06,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:06,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:06,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:06,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:07,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 326 [2023-08-30 03:13:07,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 124 flow. Second operand has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:07,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 326 [2023-08-30 03:13:07,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:07,505 INFO L130 PetriNetUnfolder]: 392/752 cut-off events. [2023-08-30 03:13:07,505 INFO L131 PetriNetUnfolder]: For 445/445 co-relation queries the response was YES. [2023-08-30 03:13:07,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 752 events. 392/752 cut-off events. For 445/445 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3459 event pairs, 170 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 2100. Up to 484 conditions per place. [2023-08-30 03:13:07,508 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 61 selfloop transitions, 10 changer transitions 0/72 dead transitions. [2023-08-30 03:13:07,508 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 72 transitions, 422 flow [2023-08-30 03:13:07,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:07,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:07,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 602 transitions. [2023-08-30 03:13:07,510 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3693251533742331 [2023-08-30 03:13:07,510 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 602 transitions. [2023-08-30 03:13:07,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 602 transitions. [2023-08-30 03:13:07,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:07,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 602 transitions. [2023-08-30 03:13:07,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,515 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,516 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 124 flow. Second operand 5 states and 602 transitions. [2023-08-30 03:13:07,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 72 transitions, 422 flow [2023-08-30 03:13:07,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 72 transitions, 419 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:07,520 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 181 flow [2023-08-30 03:13:07,520 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=181, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-08-30 03:13:07,521 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -47 predicate places. [2023-08-30 03:13:07,521 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 181 flow [2023-08-30 03:13:07,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:07,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:07,522 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:07,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:07,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:07,733 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:07,733 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:07,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1840230614, now seen corresponding path program 3 times [2023-08-30 03:13:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1275751378] [2023-08-30 03:13:07,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:13:07,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:07,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:07,735 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-30 03:13:07,738 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-30 03:13:07,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:13:07,907 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:07,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2023-08-30 03:13:07,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:08,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2023-08-30 03:13:08,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:13:09,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2023-08-30 03:13:09,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:13:09,751 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-08-30 03:13:09,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:09,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:09,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:09,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1275751378] [2023-08-30 03:13:09,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1275751378] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:09,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:09,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:09,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093401711] [2023-08-30 03:13:09,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:09,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:09,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:09,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:09,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:10,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 326 [2023-08-30 03:13:10,598 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:10,598 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:10,598 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 326 [2023-08-30 03:13:10,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:11,102 INFO L130 PetriNetUnfolder]: 442/862 cut-off events. [2023-08-30 03:13:11,102 INFO L131 PetriNetUnfolder]: For 807/807 co-relation queries the response was YES. [2023-08-30 03:13:11,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2863 conditions, 862 events. 442/862 cut-off events. For 807/807 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4340 event pairs, 178 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 2853. Up to 470 conditions per place. [2023-08-30 03:13:11,107 INFO L137 encePairwiseOnDemand]: 319/326 looper letters, 59 selfloop transitions, 10 changer transitions 0/70 dead transitions. [2023-08-30 03:13:11,107 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 455 flow [2023-08-30 03:13:11,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 03:13:11,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 03:13:11,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 598 transitions. [2023-08-30 03:13:11,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36687116564417177 [2023-08-30 03:13:11,111 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 598 transitions. [2023-08-30 03:13:11,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 598 transitions. [2023-08-30 03:13:11,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:11,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 598 transitions. [2023-08-30 03:13:11,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.6) internal successors, (598), 5 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,117 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 326.0) internal successors, (1956), 6 states have internal predecessors, (1956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,117 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 181 flow. Second operand 5 states and 598 transitions. [2023-08-30 03:13:11,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 455 flow [2023-08-30 03:13:11,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 70 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:11,123 INFO L231 Difference]: Finished difference. Result has 56 places, 44 transitions, 225 flow [2023-08-30 03:13:11,123 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=225, PETRI_PLACES=56, PETRI_TRANSITIONS=44} [2023-08-30 03:13:11,123 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -42 predicate places. [2023-08-30 03:13:11,123 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 44 transitions, 225 flow [2023-08-30 03:13:11,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:11,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:11,125 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:11,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:11,344 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-30 03:13:11,344 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:11,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1310269946, now seen corresponding path program 4 times [2023-08-30 03:13:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:11,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975355886] [2023-08-30 03:13:11,346 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:13:11,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:11,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:11,348 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-30 03:13:11,351 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-30 03:13:11,528 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:13:11,528 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:11,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 03:13:11,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:11,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:11,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:12,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:12,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975355886] [2023-08-30 03:13:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1975355886] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:12,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:12,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555377885] [2023-08-30 03:13:12,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:12,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:12,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:12,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:12,297 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 326 [2023-08-30 03:13:12,298 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 44 transitions, 225 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,298 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:12,298 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 326 [2023-08-30 03:13:12,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:12,733 INFO L130 PetriNetUnfolder]: 499/983 cut-off events. [2023-08-30 03:13:12,733 INFO L131 PetriNetUnfolder]: For 1452/1452 co-relation queries the response was YES. [2023-08-30 03:13:12,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 983 events. 499/983 cut-off events. For 1452/1452 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5168 event pairs, 235 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 3542. Up to 597 conditions per place. [2023-08-30 03:13:12,738 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 70 selfloop transitions, 11 changer transitions 0/82 dead transitions. [2023-08-30 03:13:12,738 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 576 flow [2023-08-30 03:13:12,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 829 transitions. [2023-08-30 03:13:12,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3632778264680105 [2023-08-30 03:13:12,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 829 transitions. [2023-08-30 03:13:12,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 829 transitions. [2023-08-30 03:13:12,742 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:12,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 829 transitions. [2023-08-30 03:13:12,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.42857142857143) internal successors, (829), 7 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,747 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,747 INFO L175 Difference]: Start difference. First operand has 56 places, 44 transitions, 225 flow. Second operand 7 states and 829 transitions. [2023-08-30 03:13:12,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 576 flow [2023-08-30 03:13:12,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 82 transitions, 575 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:12,755 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 308 flow [2023-08-30 03:13:12,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=308, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-30 03:13:12,756 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -33 predicate places. [2023-08-30 03:13:12,756 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 308 flow [2023-08-30 03:13:12,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:12,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:12,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:12,769 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 (13)] Ended with exit code 0 [2023-08-30 03:13:12,967 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-30 03:13:12,967 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:12,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 553534808, now seen corresponding path program 5 times [2023-08-30 03:13:12,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:12,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825852124] [2023-08-30 03:13:12,968 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 03:13:12,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:12,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:12,969 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:12,970 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 (14)] Waiting until timeout for monitored process [2023-08-30 03:13:13,159 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:13:13,160 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:13,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-30 03:13:13,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:13,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:13,263 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 03:13:13,263 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-30 03:13:13,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 03:13:13,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-08-30 03:13:13,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:13,851 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:13,851 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:13,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825852124] [2023-08-30 03:13:13,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1825852124] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:13,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:13,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:13:13,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000946749] [2023-08-30 03:13:13,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:13,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:13:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:13,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:13:13,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:13:14,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 326 [2023-08-30 03:13:14,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 308 flow. Second operand has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:14,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 326 [2023-08-30 03:13:14,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:14,950 INFO L130 PetriNetUnfolder]: 631/1230 cut-off events. [2023-08-30 03:13:14,950 INFO L131 PetriNetUnfolder]: For 3148/3148 co-relation queries the response was YES. [2023-08-30 03:13:14,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5220 conditions, 1230 events. 631/1230 cut-off events. For 3148/3148 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6803 event pairs, 270 based on Foata normal form. 1/1231 useless extension candidates. Maximal degree in co-relation 5204. Up to 960 conditions per place. [2023-08-30 03:13:14,962 INFO L137 encePairwiseOnDemand]: 316/326 looper letters, 83 selfloop transitions, 23 changer transitions 0/107 dead transitions. [2023-08-30 03:13:14,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 107 transitions, 876 flow [2023-08-30 03:13:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:13:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:13:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1108 transitions. [2023-08-30 03:13:14,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3398773006134969 [2023-08-30 03:13:14,966 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1108 transitions. [2023-08-30 03:13:14,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1108 transitions. [2023-08-30 03:13:14,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:14,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1108 transitions. [2023-08-30 03:13:14,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 110.8) internal successors, (1108), 10 states have internal predecessors, (1108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,973 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,973 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 308 flow. Second operand 10 states and 1108 transitions. [2023-08-30 03:13:14,973 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 107 transitions, 876 flow [2023-08-30 03:13:14,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 107 transitions, 859 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:14,987 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 541 flow [2023-08-30 03:13:14,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=541, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2023-08-30 03:13:14,987 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -22 predicate places. [2023-08-30 03:13:14,988 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 541 flow [2023-08-30 03:13:14,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 106.625) internal successors, (853), 8 states have internal predecessors, (853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:14,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:14,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:14,996 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 (14)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:15,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:15,189 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:15,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:15,189 INFO L85 PathProgramCache]: Analyzing trace with hash -884481228, now seen corresponding path program 6 times [2023-08-30 03:13:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:15,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427589989] [2023-08-30 03:13:15,190 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 03:13:15,190 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:15,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:15,192 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:15,192 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 (15)] Waiting until timeout for monitored process [2023-08-30 03:13:15,349 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 03:13:15,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:15,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 03:13:15,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:15,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:15,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:15,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:15,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:15,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:15,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427589989] [2023-08-30 03:13:15,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427589989] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:15,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:15,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:15,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395235679] [2023-08-30 03:13:15,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:15,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:15,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:15,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:15,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:16,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 326 [2023-08-30 03:13:16,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 541 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:16,302 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:16,302 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 326 [2023-08-30 03:13:16,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:16,907 INFO L130 PetriNetUnfolder]: 649/1279 cut-off events. [2023-08-30 03:13:16,907 INFO L131 PetriNetUnfolder]: For 4152/4160 co-relation queries the response was YES. [2023-08-30 03:13:16,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5853 conditions, 1279 events. 649/1279 cut-off events. For 4152/4160 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7146 event pairs, 235 based on Foata normal form. 1/1279 useless extension candidates. Maximal degree in co-relation 5833. Up to 706 conditions per place. [2023-08-30 03:13:16,914 INFO L137 encePairwiseOnDemand]: 319/326 looper letters, 83 selfloop transitions, 20 changer transitions 0/104 dead transitions. [2023-08-30 03:13:16,914 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 104 transitions, 942 flow [2023-08-30 03:13:16,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:16,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:16,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-30 03:13:16,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35977212971078004 [2023-08-30 03:13:16,919 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-30 03:13:16,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-30 03:13:16,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:16,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-30 03:13:16,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:16,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:16,924 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:16,924 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 541 flow. Second operand 7 states and 821 transitions. [2023-08-30 03:13:16,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 104 transitions, 942 flow [2023-08-30 03:13:16,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 104 transitions, 915 flow, removed 13 selfloop flow, removed 1 redundant places. [2023-08-30 03:13:16,942 INFO L231 Difference]: Finished difference. Result has 83 places, 75 transitions, 609 flow [2023-08-30 03:13:16,942 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=514, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=609, PETRI_PLACES=83, PETRI_TRANSITIONS=75} [2023-08-30 03:13:16,943 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -15 predicate places. [2023-08-30 03:13:16,943 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 75 transitions, 609 flow [2023-08-30 03:13:16,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:16,943 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:16,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:16,957 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 (15)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:17,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:17,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:17,154 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:17,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1293991988, now seen corresponding path program 7 times [2023-08-30 03:13:17,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:17,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117503313] [2023-08-30 03:13:17,155 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 03:13:17,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:17,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:17,156 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:17,157 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 (16)] Waiting until timeout for monitored process [2023-08-30 03:13:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 03:13:17,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 30 conjunts are in the unsatisfiable core [2023-08-30 03:13:17,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:17,443 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:17,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-08-30 03:13:17,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:17,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:18,015 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:18,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117503313] [2023-08-30 03:13:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2117503313] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:18,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:18,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:18,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265587643] [2023-08-30 03:13:18,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:18,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:18,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 326 [2023-08-30 03:13:18,425 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 75 transitions, 609 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:18,425 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:18,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 326 [2023-08-30 03:13:18,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:19,014 INFO L130 PetriNetUnfolder]: 736/1464 cut-off events. [2023-08-30 03:13:19,014 INFO L131 PetriNetUnfolder]: For 6530/6538 co-relation queries the response was YES. [2023-08-30 03:13:19,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7092 conditions, 1464 events. 736/1464 cut-off events. For 6530/6538 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 8653 event pairs, 297 based on Foata normal form. 9/1469 useless extension candidates. Maximal degree in co-relation 7070. Up to 1128 conditions per place. [2023-08-30 03:13:19,022 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 95 selfloop transitions, 19 changer transitions 0/115 dead transitions. [2023-08-30 03:13:19,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 115 transitions, 1100 flow [2023-08-30 03:13:19,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:19,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 824 transitions. [2023-08-30 03:13:19,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36108676599474143 [2023-08-30 03:13:19,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 824 transitions. [2023-08-30 03:13:19,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 824 transitions. [2023-08-30 03:13:19,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:19,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 824 transitions. [2023-08-30 03:13:19,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.71428571428571) internal successors, (824), 7 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:19,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:19,031 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:19,032 INFO L175 Difference]: Start difference. First operand has 83 places, 75 transitions, 609 flow. Second operand 7 states and 824 transitions. [2023-08-30 03:13:19,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 115 transitions, 1100 flow [2023-08-30 03:13:19,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 115 transitions, 1061 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:19,061 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 722 flow [2023-08-30 03:13:19,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=722, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2023-08-30 03:13:19,062 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, -7 predicate places. [2023-08-30 03:13:19,062 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 722 flow [2023-08-30 03:13:19,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:19,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:19,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:19,073 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 (16)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:19,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:19,273 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:19,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:19,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1604231066, now seen corresponding path program 8 times [2023-08-30 03:13:19,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:19,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928208113] [2023-08-30 03:13:19,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 03:13:19,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:19,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:19,275 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:19,276 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 (17)] Waiting until timeout for monitored process [2023-08-30 03:13:19,471 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:13:19,472 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:19,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 19 conjunts are in the unsatisfiable core [2023-08-30 03:13:19,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:19,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:19,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:19,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:20,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:20,008 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:20,008 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:20,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928208113] [2023-08-30 03:13:20,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928208113] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:20,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:20,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:20,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449876431] [2023-08-30 03:13:20,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:20,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:20,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:20,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:20,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 326 [2023-08-30 03:13:20,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 722 flow. Second operand has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:20,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:20,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 326 [2023-08-30 03:13:20,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:20,916 INFO L130 PetriNetUnfolder]: 816/1680 cut-off events. [2023-08-30 03:13:20,917 INFO L131 PetriNetUnfolder]: For 7305/7313 co-relation queries the response was YES. [2023-08-30 03:13:20,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8080 conditions, 1680 events. 816/1680 cut-off events. For 7305/7313 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 10619 event pairs, 265 based on Foata normal form. 1/1680 useless extension candidates. Maximal degree in co-relation 8054. Up to 827 conditions per place. [2023-08-30 03:13:20,925 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 103 selfloop transitions, 25 changer transitions 0/129 dead transitions. [2023-08-30 03:13:20,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 129 transitions, 1248 flow [2023-08-30 03:13:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:20,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-30 03:13:20,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3654688869412796 [2023-08-30 03:13:20,928 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-30 03:13:20,928 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-30 03:13:20,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:20,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-30 03:13:20,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:20,931 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:20,932 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:20,932 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 722 flow. Second operand 7 states and 834 transitions. [2023-08-30 03:13:20,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 129 transitions, 1248 flow [2023-08-30 03:13:20,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 129 transitions, 1221 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:20,967 INFO L231 Difference]: Finished difference. Result has 98 places, 88 transitions, 822 flow [2023-08-30 03:13:20,967 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=822, PETRI_PLACES=98, PETRI_TRANSITIONS=88} [2023-08-30 03:13:20,968 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 0 predicate places. [2023-08-30 03:13:20,968 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 88 transitions, 822 flow [2023-08-30 03:13:20,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.0) internal successors, (798), 7 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:20,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:20,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:20,979 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 (17)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:21,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:21,180 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:21,180 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:21,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1941437136, now seen corresponding path program 9 times [2023-08-30 03:13:21,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:21,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004058885] [2023-08-30 03:13:21,181 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-30 03:13:21,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:21,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:21,182 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:21,183 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 (18)] Waiting until timeout for monitored process [2023-08-30 03:13:21,351 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-08-30 03:13:21,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:21,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-30 03:13:21,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:21,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:21,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:21,700 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:21,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:21,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:21,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:21,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004058885] [2023-08-30 03:13:21,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004058885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:21,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-30 03:13:21,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487431549] [2023-08-30 03:13:21,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:21,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-30 03:13:21,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-30 03:13:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-08-30 03:13:22,630 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 326 [2023-08-30 03:13:22,631 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 88 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 112.625) internal successors, (901), 8 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:22,631 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:22,631 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 326 [2023-08-30 03:13:22,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:23,202 INFO L130 PetriNetUnfolder]: 826/1712 cut-off events. [2023-08-30 03:13:23,202 INFO L131 PetriNetUnfolder]: For 9306/9314 co-relation queries the response was YES. [2023-08-30 03:13:23,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8552 conditions, 1712 events. 826/1712 cut-off events. For 9306/9314 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 10942 event pairs, 253 based on Foata normal form. 1/1712 useless extension candidates. Maximal degree in co-relation 8523. Up to 573 conditions per place. [2023-08-30 03:13:23,212 INFO L137 encePairwiseOnDemand]: 319/326 looper letters, 94 selfloop transitions, 26 changer transitions 0/121 dead transitions. [2023-08-30 03:13:23,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 121 transitions, 1265 flow [2023-08-30 03:13:23,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:23,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 821 transitions. [2023-08-30 03:13:23,215 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35977212971078004 [2023-08-30 03:13:23,215 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 821 transitions. [2023-08-30 03:13:23,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 821 transitions. [2023-08-30 03:13:23,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:23,216 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 821 transitions. [2023-08-30 03:13:23,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:23,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:23,221 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:23,221 INFO L175 Difference]: Start difference. First operand has 98 places, 88 transitions, 822 flow. Second operand 7 states and 821 transitions. [2023-08-30 03:13:23,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 121 transitions, 1265 flow [2023-08-30 03:13:23,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 121 transitions, 1248 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-30 03:13:23,261 INFO L231 Difference]: Finished difference. Result has 104 places, 92 transitions, 922 flow [2023-08-30 03:13:23,262 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=805, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=922, PETRI_PLACES=104, PETRI_TRANSITIONS=92} [2023-08-30 03:13:23,262 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 6 predicate places. [2023-08-30 03:13:23,262 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 92 transitions, 922 flow [2023-08-30 03:13:23,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.625) internal successors, (901), 8 states have internal predecessors, (901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:23,263 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:23,263 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:23,276 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 (18)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:23,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:23,474 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:23,474 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1226993716, now seen corresponding path program 10 times [2023-08-30 03:13:23,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:23,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011298769] [2023-08-30 03:13:23,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-30 03:13:23,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:23,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:23,476 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:23,477 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 (19)] Waiting until timeout for monitored process [2023-08-30 03:13:23,679 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-30 03:13:23,679 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:23,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 38 conjunts are in the unsatisfiable core [2023-08-30 03:13:23,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:23,714 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:13:23,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:13:23,809 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-30 03:13:23,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-30 03:13:23,862 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-30 03:13:23,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-30 03:13:23,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:23,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-30 03:13:24,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 49 [2023-08-30 03:13:24,201 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:24,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:24,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:24,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:24,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:24,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011298769] [2023-08-30 03:13:24,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011298769] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:24,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:24,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-30 03:13:24,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50632251] [2023-08-30 03:13:24,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:24,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-30 03:13:24,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:24,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-30 03:13:24,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-30 03:13:25,284 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 326 [2023-08-30 03:13:25,285 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 92 transitions, 922 flow. Second operand has 9 states, 9 states have (on average 107.33333333333333) internal successors, (966), 9 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:25,285 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:25,285 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 326 [2023-08-30 03:13:25,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:26,147 INFO L130 PetriNetUnfolder]: 876/1828 cut-off events. [2023-08-30 03:13:26,147 INFO L131 PetriNetUnfolder]: For 11433/11441 co-relation queries the response was YES. [2023-08-30 03:13:26,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9294 conditions, 1828 events. 876/1828 cut-off events. For 11433/11441 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 12077 event pairs, 188 based on Foata normal form. 9/1837 useless extension candidates. Maximal degree in co-relation 9263. Up to 1043 conditions per place. [2023-08-30 03:13:26,158 INFO L137 encePairwiseOnDemand]: 316/326 looper letters, 102 selfloop transitions, 40 changer transitions 0/143 dead transitions. [2023-08-30 03:13:26,158 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 143 transitions, 1568 flow [2023-08-30 03:13:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-30 03:13:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-30 03:13:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1113 transitions. [2023-08-30 03:13:26,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3414110429447853 [2023-08-30 03:13:26,162 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1113 transitions. [2023-08-30 03:13:26,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1113 transitions. [2023-08-30 03:13:26,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:26,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1113 transitions. [2023-08-30 03:13:26,165 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 111.3) internal successors, (1113), 10 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:26,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:26,168 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 326.0) internal successors, (3586), 11 states have internal predecessors, (3586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:26,168 INFO L175 Difference]: Start difference. First operand has 104 places, 92 transitions, 922 flow. Second operand 10 states and 1113 transitions. [2023-08-30 03:13:26,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 143 transitions, 1568 flow [2023-08-30 03:13:26,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 143 transitions, 1520 flow, removed 11 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:26,216 INFO L231 Difference]: Finished difference. Result has 113 places, 97 transitions, 1061 flow [2023-08-30 03:13:26,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1061, PETRI_PLACES=113, PETRI_TRANSITIONS=97} [2023-08-30 03:13:26,216 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 15 predicate places. [2023-08-30 03:13:26,216 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 97 transitions, 1061 flow [2023-08-30 03:13:26,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 107.33333333333333) internal successors, (966), 9 states have internal predecessors, (966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:26,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:26,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:26,230 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 (19)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:26,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:26,429 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:26,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:26,430 INFO L85 PathProgramCache]: Analyzing trace with hash -388820276, now seen corresponding path program 11 times [2023-08-30 03:13:26,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:26,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315367086] [2023-08-30 03:13:26,430 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-30 03:13:26,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:26,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:26,431 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:26,434 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 (20)] Waiting until timeout for monitored process [2023-08-30 03:13:26,615 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-30 03:13:26,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:26,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 14 conjunts are in the unsatisfiable core [2023-08-30 03:13:26,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:26,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:26,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:26,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:26,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:26,985 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:26,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315367086] [2023-08-30 03:13:26,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315367086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:26,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:26,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 03:13:26,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442402070] [2023-08-30 03:13:26,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:26,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 03:13:26,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 03:13:26,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-30 03:13:27,154 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 326 [2023-08-30 03:13:27,154 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 97 transitions, 1061 flow. Second operand has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:27,154 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:27,154 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 326 [2023-08-30 03:13:27,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:27,602 INFO L130 PetriNetUnfolder]: 948/1988 cut-off events. [2023-08-30 03:13:27,602 INFO L131 PetriNetUnfolder]: For 13186/13194 co-relation queries the response was YES. [2023-08-30 03:13:27,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10363 conditions, 1988 events. 948/1988 cut-off events. For 13186/13194 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 13462 event pairs, 367 based on Foata normal form. 9/1997 useless extension candidates. Maximal degree in co-relation 10329. Up to 1498 conditions per place. [2023-08-30 03:13:27,614 INFO L137 encePairwiseOnDemand]: 318/326 looper letters, 121 selfloop transitions, 13 changer transitions 0/135 dead transitions. [2023-08-30 03:13:27,614 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 135 transitions, 1611 flow [2023-08-30 03:13:27,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:27,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 830 transitions. [2023-08-30 03:13:27,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3637160385626643 [2023-08-30 03:13:27,616 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 830 transitions. [2023-08-30 03:13:27,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 830 transitions. [2023-08-30 03:13:27,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:27,617 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 830 transitions. [2023-08-30 03:13:27,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.57142857142857) internal successors, (830), 7 states have internal predecessors, (830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:27,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:27,621 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:27,621 INFO L175 Difference]: Start difference. First operand has 113 places, 97 transitions, 1061 flow. Second operand 7 states and 830 transitions. [2023-08-30 03:13:27,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 135 transitions, 1611 flow [2023-08-30 03:13:27,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 135 transitions, 1562 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:27,676 INFO L231 Difference]: Finished difference. Result has 118 places, 101 transitions, 1110 flow [2023-08-30 03:13:27,676 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1017, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1110, PETRI_PLACES=118, PETRI_TRANSITIONS=101} [2023-08-30 03:13:27,676 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 20 predicate places. [2023-08-30 03:13:27,677 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 101 transitions, 1110 flow [2023-08-30 03:13:27,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 114.5) internal successors, (687), 6 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:27,677 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:27,677 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:27,691 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 (20)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:27,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:27,889 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:27,890 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:27,890 INFO L85 PathProgramCache]: Analyzing trace with hash -7117286, now seen corresponding path program 12 times [2023-08-30 03:13:27,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:27,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514849885] [2023-08-30 03:13:27,890 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-30 03:13:27,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:27,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:27,891 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:27,892 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 (21)] Waiting until timeout for monitored process [2023-08-30 03:13:28,070 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-08-30 03:13:28,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 03:13:28,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 23 conjunts are in the unsatisfiable core [2023-08-30 03:13:28,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 03:13:28,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-30 03:13:28,252 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-30 03:13:28,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-08-30 03:13:28,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 03:13:28,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-30 03:13:28,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-30 03:13:28,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514849885] [2023-08-30 03:13:28,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514849885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 03:13:28,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 03:13:28,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-30 03:13:28,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074903306] [2023-08-30 03:13:28,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 03:13:28,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-30 03:13:28,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-30 03:13:28,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-30 03:13:28,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-30 03:13:29,087 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 326 [2023-08-30 03:13:29,088 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 101 transitions, 1110 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,088 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 03:13:29,088 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 326 [2023-08-30 03:13:29,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 03:13:29,683 INFO L130 PetriNetUnfolder]: 974/2052 cut-off events. [2023-08-30 03:13:29,683 INFO L131 PetriNetUnfolder]: For 13231/13239 co-relation queries the response was YES. [2023-08-30 03:13:29,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10738 conditions, 2052 events. 974/2052 cut-off events. For 13231/13239 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 14077 event pairs, 370 based on Foata normal form. 9/2061 useless extension candidates. Maximal degree in co-relation 10702. Up to 1476 conditions per place. [2023-08-30 03:13:29,695 INFO L137 encePairwiseOnDemand]: 319/326 looper letters, 120 selfloop transitions, 15 changer transitions 0/136 dead transitions. [2023-08-30 03:13:29,696 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 136 transitions, 1622 flow [2023-08-30 03:13:29,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-30 03:13:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-30 03:13:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 822 transitions. [2023-08-30 03:13:29,697 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3602103418054338 [2023-08-30 03:13:29,698 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 822 transitions. [2023-08-30 03:13:29,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 822 transitions. [2023-08-30 03:13:29,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 03:13:29,698 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 822 transitions. [2023-08-30 03:13:29,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,702 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 326.0) internal successors, (2608), 8 states have internal predecessors, (2608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,702 INFO L175 Difference]: Start difference. First operand has 118 places, 101 transitions, 1110 flow. Second operand 7 states and 822 transitions. [2023-08-30 03:13:29,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 136 transitions, 1622 flow [2023-08-30 03:13:29,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 1581 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-08-30 03:13:29,750 INFO L231 Difference]: Finished difference. Result has 123 places, 104 transitions, 1164 flow [2023-08-30 03:13:29,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=326, PETRI_DIFFERENCE_MINUEND_FLOW=1069, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1164, PETRI_PLACES=123, PETRI_TRANSITIONS=104} [2023-08-30 03:13:29,750 INFO L281 CegarLoopForPetriNet]: 98 programPoint places, 25 predicate places. [2023-08-30 03:13:29,751 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 104 transitions, 1164 flow [2023-08-30 03:13:29,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 03:13:29,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 03:13:29,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:29,761 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 (21)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:29,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:29,957 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 98 more)] === [2023-08-30 03:13:29,958 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 03:13:29,958 INFO L85 PathProgramCache]: Analyzing trace with hash -148710382, now seen corresponding path program 13 times [2023-08-30 03:13:29,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-30 03:13:29,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2093047048] [2023-08-30 03:13:29,958 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-30 03:13:29,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:29,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-30 03:13:29,959 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-30 03:13:29,960 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 (22)] Waiting until timeout for monitored process [2023-08-30 03:13:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:13:30,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-30 03:13:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-30 03:13:30,406 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-30 03:13:30,406 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-30 03:13:30,407 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (100 of 101 remaining) [2023-08-30 03:13:30,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 101 remaining) [2023-08-30 03:13:30,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 101 remaining) [2023-08-30 03:13:30,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 101 remaining) [2023-08-30 03:13:30,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 101 remaining) [2023-08-30 03:13:30,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 101 remaining) [2023-08-30 03:13:30,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 101 remaining) [2023-08-30 03:13:30,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 101 remaining) [2023-08-30 03:13:30,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 101 remaining) [2023-08-30 03:13:30,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 101 remaining) [2023-08-30 03:13:30,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 101 remaining) [2023-08-30 03:13:30,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 101 remaining) [2023-08-30 03:13:30,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 101 remaining) [2023-08-30 03:13:30,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 101 remaining) [2023-08-30 03:13:30,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 101 remaining) [2023-08-30 03:13:30,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 101 remaining) [2023-08-30 03:13:30,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 101 remaining) [2023-08-30 03:13:30,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 101 remaining) [2023-08-30 03:13:30,415 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 101 remaining) [2023-08-30 03:13:30,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 101 remaining) [2023-08-30 03:13:30,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 101 remaining) [2023-08-30 03:13:30,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 101 remaining) [2023-08-30 03:13:30,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 101 remaining) [2023-08-30 03:13:30,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 101 remaining) [2023-08-30 03:13:30,416 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 101 remaining) [2023-08-30 03:13:30,417 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (39 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 101 remaining) [2023-08-30 03:13:30,418 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 101 remaining) [2023-08-30 03:13:30,419 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 101 remaining) [2023-08-30 03:13:30,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 101 remaining) [2023-08-30 03:13:30,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 101 remaining) [2023-08-30 03:13:30,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 101 remaining) [2023-08-30 03:13:30,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 101 remaining) [2023-08-30 03:13:30,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 101 remaining) [2023-08-30 03:13:30,420 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 101 remaining) [2023-08-30 03:13:30,421 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 101 remaining) [2023-08-30 03:13:30,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 101 remaining) [2023-08-30 03:13:30,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 101 remaining) [2023-08-30 03:13:30,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 101 remaining) [2023-08-30 03:13:30,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 101 remaining) [2023-08-30 03:13:30,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 101 remaining) [2023-08-30 03:13:30,422 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 101 remaining) [2023-08-30 03:13:30,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 101 remaining) [2023-08-30 03:13:30,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 101 remaining) [2023-08-30 03:13:30,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 101 remaining) [2023-08-30 03:13:30,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 101 remaining) [2023-08-30 03:13:30,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 101 remaining) [2023-08-30 03:13:30,423 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 101 remaining) [2023-08-30 03:13:30,439 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 (22)] Forceful destruction successful, exit code 0 [2023-08-30 03:13:30,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-30 03:13:30,637 INFO L445 BasicCegarLoop]: Path program histogram: [13, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 03:13:30,643 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-30 03:13:30,643 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-30 03:13:30,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.08 03:13:30 BasicIcfg [2023-08-30 03:13:30,755 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-30 03:13:30,756 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-30 03:13:30,757 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-30 03:13:30,757 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-30 03:13:30,757 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 03:12:06" (3/4) ... [2023-08-30 03:13:30,760 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-30 03:13:30,760 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-30 03:13:30,760 INFO L158 Benchmark]: Toolchain (without parser) took 86590.34ms. Allocated memory was 71.3MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 41.6MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-30 03:13:30,760 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 56.6MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:13:30,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 586.70ms. Allocated memory is still 71.3MB. Free memory was 41.4MB in the beginning and 35.3MB in the end (delta: 6.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2023-08-30 03:13:30,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.90ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 32.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-30 03:13:30,761 INFO L158 Benchmark]: Boogie Preprocessor took 76.56ms. Allocated memory is still 71.3MB. Free memory was 32.5MB in the beginning and 48.8MB in the end (delta: -16.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2023-08-30 03:13:30,762 INFO L158 Benchmark]: RCFGBuilder took 1569.55ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 48.8MB in the beginning and 71.5MB in the end (delta: -22.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2023-08-30 03:13:30,762 INFO L158 Benchmark]: TraceAbstraction took 84264.09ms. Allocated memory was 104.9MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 71.1MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2023-08-30 03:13:30,763 INFO L158 Benchmark]: Witness Printer took 4.15ms. Allocated memory is still 5.7GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-30 03:13:30,764 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.33ms. Allocated memory is still 56.6MB. Free memory is still 34.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 586.70ms. Allocated memory is still 71.3MB. Free memory was 41.4MB in the beginning and 35.3MB in the end (delta: 6.1MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 79.90ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 32.5MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.56ms. Allocated memory is still 71.3MB. Free memory was 32.5MB in the beginning and 48.8MB in the end (delta: -16.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * RCFGBuilder took 1569.55ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 48.8MB in the beginning and 71.5MB in the end (delta: -22.7MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * TraceAbstraction took 84264.09ms. Allocated memory was 104.9MB in the beginning and 5.7GB in the end (delta: 5.6GB). Free memory was 71.1MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 4.15ms. Allocated memory is still 5.7GB. Free memory is still 4.4GB. 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: 41.8s, 194 PlacesBefore, 98 PlacesAfterwards, 186 TransitionsBefore, 89 TransitionsAfterwards, 8576 CoEnabledTransitionPairs, 8 FixpointIterations, 64 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 137 TotalNumberOfCompositions, 62906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11805, independent: 10823, independent conditional: 0, independent unconditional: 10823, dependent: 982, dependent conditional: 0, dependent unconditional: 982, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3169, independent: 3035, independent conditional: 0, independent unconditional: 3035, dependent: 134, dependent conditional: 0, dependent unconditional: 134, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11805, independent: 7788, independent conditional: 0, independent unconditional: 7788, dependent: 848, dependent conditional: 0, dependent unconditional: 848, unknown: 3169, unknown conditional: 0, unknown unconditional: 3169] , Statistics on independence cache: Total cache size (in pairs): 556, Positive cache size: 470, Positive conditional cache size: 0, Positive unconditional cache size: 470, Negative cache size: 86, Negative conditional cache size: 0, Negative unconditional cache size: 86, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2133; [L853] FCALL, FORK 0 pthread_create(&t2133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2133, ((void *)0), P0, ((void *)0))=-1, t2133={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L854] 0 pthread_t t2134; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, t2134={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L855] FCALL, FORK 0 pthread_create(&t2134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2134, ((void *)0), P1, ((void *)0))=0, t2133={7:0}, t2134={14:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L856] 0 pthread_t t2135; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2133={7:0}, t2134={14:0}, t2135={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L857] FCALL, FORK 0 pthread_create(&t2135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2135, ((void *)0), P2, ((void *)0))=1, t2133={7:0}, t2134={14:0}, t2135={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] EXPR 3 \read(x) [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L792] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2133={7:0}, t2134={14:0}, t2135={15:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=2, weak$$choice2=128, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 250 locations, 101 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: 83.9s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 13, EmptinessCheckTime: 0.0s, AutomataDifference: 24.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 41.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2794 SdHoareTripleChecker+Valid, 10.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1953 mSDsluCounter, 1873 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1569 mSDsCounter, 576 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6683 IncrementalHoareTripleChecker+Invalid, 7259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 576 mSolverCounterUnsat, 304 mSDtfsCounter, 6683 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1164occurred in iteration=20, InterpolantAutomatonStates: 111, 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.5s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 9.3s InterpolantComputationTime, 382 NumberOfCodeBlocks, 382 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 340 ConstructedInterpolants, 0 QuantifiedInterpolants, 6120 SizeOfPredicates, 74 NumberOfNonLiveVariables, 3901 ConjunctsInSsa, 355 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-30 03:13:30,795 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