./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:39:36,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:39:36,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 19:39:36,502 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:39:36,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:39:36,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:39:36,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:39:36,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:39:36,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:39:36,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:39:36,532 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:39:36,532 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:39:36,533 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:39:36,533 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:39:36,533 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:39:36,534 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:39:36,534 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:39:36,534 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:39:36,535 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:39:36,535 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:39:36,535 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:39:36,536 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:39:36,536 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:39:36,536 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:39:36,536 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:39:36,537 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:39:36,537 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:39:36,537 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:39:36,537 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:39:36,538 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:39:36,538 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:39:36,538 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:39:36,539 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:39:36,539 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:39:36,539 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:39:36,539 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:39:36,540 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 19:39:36,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 19:39:36,540 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:39:36,540 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:39:36,541 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:39:36,541 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:39:36,541 INFO L153 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2024-10-11 19:39:36,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:39:36,792 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:39:36,795 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:39:36,797 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:39:36,797 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:39:36,798 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2024-10-11 19:39:38,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:39:38,482 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:39:38,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2024-10-11 19:39:38,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ea32ba6cc/7d6f84eecc3e4bde9b7f39c35b20bf6c/FLAGaa8c43ce4 [2024-10-11 19:39:38,842 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ea32ba6cc/7d6f84eecc3e4bde9b7f39c35b20bf6c [2024-10-11 19:39:38,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:39:38,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:39:38,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:39:38,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:39:38,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:39:38,851 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:38" (1/1) ... [2024-10-11 19:39:38,852 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b2302a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:38, skipping insertion in model container [2024-10-11 19:39:38,852 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:38" (1/1) ... [2024-10-11 19:39:38,896 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:39:39,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:39:39,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:39:39,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:39:39,395 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:39:39,395 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39 WrapperNode [2024-10-11 19:39:39,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:39:39,396 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:39:39,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:39:39,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:39:39,403 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,416 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,433 INFO L138 Inliner]: procedures = 175, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-10-11 19:39:39,436 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:39:39,437 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:39:39,437 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:39:39,437 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:39:39,449 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,449 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,452 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,466 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-10-11 19:39:39,467 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,467 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,476 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,477 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:39:39,482 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:39:39,482 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:39:39,482 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:39:39,483 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (1/1) ... [2024-10-11 19:39:39,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:39:39,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:39:39,515 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:39:39,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:39:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 19:39:39,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 19:39:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 19:39:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 19:39:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:39:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:39:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:39:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:39:39,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:39:39,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:39:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 19:39:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 19:39:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 19:39:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 19:39:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:39:39,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:39:39,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:39:39,560 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:39:39,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:39:39,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:39:40,123 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:39:40,123 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:39:40,543 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:39:40,544 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:39:40,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:40 BoogieIcfgContainer [2024-10-11 19:39:40,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:39:40,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:39:40,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:39:40,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:39:40,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:39:38" (1/3) ... [2024-10-11 19:39:40,550 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71985a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:40, skipping insertion in model container [2024-10-11 19:39:40,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:39" (2/3) ... [2024-10-11 19:39:40,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71985a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:40, skipping insertion in model container [2024-10-11 19:39:40,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:40" (3/3) ... [2024-10-11 19:39:40,554 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2024-10-11 19:39:40,567 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:39:40,568 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-11 19:39:40,568 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:39:40,633 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:39:40,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 66 transitions, 144 flow [2024-10-11 19:39:40,706 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-10-11 19:39:40,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:40,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 204 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2024-10-11 19:39:40,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 66 transitions, 144 flow [2024-10-11 19:39:40,721 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 63 transitions, 135 flow [2024-10-11 19:39:40,735 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:39:40,746 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@12acb904, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:39:40,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-11 19:39:40,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:39:40,753 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-11 19:39:40,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:40,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:40,754 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:39:40,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:40,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:40,761 INFO L85 PathProgramCache]: Analyzing trace with hash 17992464, now seen corresponding path program 1 times [2024-10-11 19:39:40,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:40,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711067123] [2024-10-11 19:39:40,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:40,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:41,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:41,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:41,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711067123] [2024-10-11 19:39:41,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711067123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:41,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:41,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:41,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7966305] [2024-10-11 19:39:41,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:41,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:41,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:41,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:41,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:41,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:41,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:41,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:41,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:41,881 INFO L124 PetriNetUnfolderBase]: 1505/2566 cut-off events. [2024-10-11 19:39:41,881 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:41,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4855 conditions, 2566 events. 1505/2566 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 18679 event pairs, 1505 based on Foata normal form. 112/1906 useless extension candidates. Maximal degree in co-relation 4844. Up to 2258 conditions per place. [2024-10-11 19:39:41,927 INFO L140 encePairwiseOnDemand]: 47/66 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2024-10-11 19:39:41,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 153 flow [2024-10-11 19:39:41,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:41,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-10-11 19:39:41,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5202020202020202 [2024-10-11 19:39:41,939 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 135 flow. Second operand 3 states and 103 transitions. [2024-10-11 19:39:41,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 153 flow [2024-10-11 19:39:41,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:39:41,944 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 96 flow [2024-10-11 19:39:41,946 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-10-11 19:39:41,948 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2024-10-11 19:39:41,949 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 96 flow [2024-10-11 19:39:41,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:41,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:41,949 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:39:41,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 19:39:41,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:41,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:41,951 INFO L85 PathProgramCache]: Analyzing trace with hash 17992465, now seen corresponding path program 1 times [2024-10-11 19:39:41,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:41,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88103337] [2024-10-11 19:39:41,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:41,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:42,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:42,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88103337] [2024-10-11 19:39:42,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88103337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:42,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:42,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:42,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492709613] [2024-10-11 19:39:42,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:42,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:42,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:42,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:42,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:42,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:42,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:42,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:42,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:42,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:42,258 INFO L124 PetriNetUnfolderBase]: 501/938 cut-off events. [2024-10-11 19:39:42,258 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:42,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 938 events. 501/938 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6116 event pairs, 501 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1740. Up to 784 conditions per place. [2024-10-11 19:39:42,263 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 20 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-10-11 19:39:42,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 128 flow [2024-10-11 19:39:42,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:42,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:42,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-10-11 19:39:42,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-10-11 19:39:42,267 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 96 flow. Second operand 3 states and 85 transitions. [2024-10-11 19:39:42,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 128 flow [2024-10-11 19:39:42,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:39:42,268 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 83 flow [2024-10-11 19:39:42,268 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=83, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-10-11 19:39:42,271 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2024-10-11 19:39:42,271 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 83 flow [2024-10-11 19:39:42,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:42,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:42,271 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:42,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 19:39:42,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:42,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:42,272 INFO L85 PathProgramCache]: Analyzing trace with hash 1439794122, now seen corresponding path program 1 times [2024-10-11 19:39:42,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:42,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441145352] [2024-10-11 19:39:42,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:42,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:42,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:42,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:42,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441145352] [2024-10-11 19:39:42,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441145352] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:42,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:42,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:42,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179877786] [2024-10-11 19:39:42,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:42,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:42,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:42,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:42,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:42,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:42,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:42,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:42,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:42,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:42,533 INFO L124 PetriNetUnfolderBase]: 419/781 cut-off events. [2024-10-11 19:39:42,533 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:42,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 781 events. 419/781 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 4604 event pairs, 237 based on Foata normal form. 0/737 useless extension candidates. Maximal degree in co-relation 1461. Up to 517 conditions per place. [2024-10-11 19:39:42,538 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 34 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-11 19:39:42,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 52 transitions, 189 flow [2024-10-11 19:39:42,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:42,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2024-10-11 19:39:42,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4797979797979798 [2024-10-11 19:39:42,543 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 83 flow. Second operand 3 states and 95 transitions. [2024-10-11 19:39:42,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 52 transitions, 189 flow [2024-10-11 19:39:42,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 188 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:39:42,544 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 92 flow [2024-10-11 19:39:42,545 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2024-10-11 19:39:42,546 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2024-10-11 19:39:42,546 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 92 flow [2024-10-11 19:39:42,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:42,547 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:42,547 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:42,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 19:39:42,547 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:42,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:42,548 INFO L85 PathProgramCache]: Analyzing trace with hash 662733853, now seen corresponding path program 1 times [2024-10-11 19:39:42,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:42,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753878492] [2024-10-11 19:39:42,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:42,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:42,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:42,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753878492] [2024-10-11 19:39:42,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753878492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:42,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:42,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:39:42,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487576478] [2024-10-11 19:39:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:39:42,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:42,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:39:42,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:39:42,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:42,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:42,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:42,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:42,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:42,908 INFO L124 PetriNetUnfolderBase]: 391/879 cut-off events. [2024-10-11 19:39:42,909 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-11 19:39:42,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 879 events. 391/879 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5998 event pairs, 83 based on Foata normal form. 0/861 useless extension candidates. Maximal degree in co-relation 1671. Up to 472 conditions per place. [2024-10-11 19:39:42,915 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 33 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-11 19:39:42,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 51 transitions, 192 flow [2024-10-11 19:39:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:39:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:39:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-10-11 19:39:42,918 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42424242424242425 [2024-10-11 19:39:42,918 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 92 flow. Second operand 4 states and 112 transitions. [2024-10-11 19:39:42,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 51 transitions, 192 flow [2024-10-11 19:39:42,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:39:42,921 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 88 flow [2024-10-11 19:39:42,921 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-10-11 19:39:42,922 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -22 predicate places. [2024-10-11 19:39:42,922 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 88 flow [2024-10-11 19:39:42,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:42,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:42,923 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:42,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 19:39:42,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:42,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash 662733854, now seen corresponding path program 1 times [2024-10-11 19:39:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112051035] [2024-10-11 19:39:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:42,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:43,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:43,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112051035] [2024-10-11 19:39:43,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112051035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:43,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:43,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:39:43,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399477204] [2024-10-11 19:39:43,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:43,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:39:43,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:43,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:39:43,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:39:43,102 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:43,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:43,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:43,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:43,230 INFO L124 PetriNetUnfolderBase]: 363/693 cut-off events. [2024-10-11 19:39:43,230 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-10-11 19:39:43,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 693 events. 363/693 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 3955 event pairs, 181 based on Foata normal form. 16/699 useless extension candidates. Maximal degree in co-relation 1425. Up to 428 conditions per place. [2024-10-11 19:39:43,234 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-10-11 19:39:43,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 50 transitions, 186 flow [2024-10-11 19:39:43,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:39:43,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:39:43,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-10-11 19:39:43,236 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.42045454545454547 [2024-10-11 19:39:43,236 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 88 flow. Second operand 4 states and 111 transitions. [2024-10-11 19:39:43,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 50 transitions, 186 flow [2024-10-11 19:39:43,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 181 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:39:43,237 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 83 flow [2024-10-11 19:39:43,237 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-10-11 19:39:43,238 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2024-10-11 19:39:43,238 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 83 flow [2024-10-11 19:39:43,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:43,238 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:43,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 19:39:43,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:43,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:43,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1200684914, now seen corresponding path program 1 times [2024-10-11 19:39:43,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:43,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715906477] [2024-10-11 19:39:43,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:43,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:43,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:43,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:43,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715906477] [2024-10-11 19:39:43,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715906477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:43,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:43,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258844990] [2024-10-11 19:39:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:43,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:43,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:43,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2024-10-11 19:39:43,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:43,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2024-10-11 19:39:43,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:43,440 INFO L124 PetriNetUnfolderBase]: 363/704 cut-off events. [2024-10-11 19:39:43,441 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-10-11 19:39:43,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1444 conditions, 704 events. 363/704 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4379 event pairs, 363 based on Foata normal form. 24/703 useless extension candidates. Maximal degree in co-relation 1436. Up to 574 conditions per place. [2024-10-11 19:39:43,445 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 17 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-10-11 19:39:43,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 119 flow [2024-10-11 19:39:43,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:43,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:43,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-11 19:39:43,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-10-11 19:39:43,446 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 83 flow. Second operand 3 states and 74 transitions. [2024-10-11 19:39:43,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 119 flow [2024-10-11 19:39:43,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:39:43,447 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 78 flow [2024-10-11 19:39:43,447 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2024-10-11 19:39:43,448 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -24 predicate places. [2024-10-11 19:39:43,448 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 78 flow [2024-10-11 19:39:43,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,448 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:43,449 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:43,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 19:39:43,449 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:43,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:43,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1200684472, now seen corresponding path program 1 times [2024-10-11 19:39:43,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:43,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308787296] [2024-10-11 19:39:43,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:43,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:43,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:43,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:43,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308787296] [2024-10-11 19:39:43,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308787296] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:43,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:43,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:39:43,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015035586] [2024-10-11 19:39:43,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:43,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:39:43,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:39:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:39:43,548 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2024-10-11 19:39:43,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:43,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2024-10-11 19:39:43,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:43,781 INFO L124 PetriNetUnfolderBase]: 1016/1728 cut-off events. [2024-10-11 19:39:43,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:43,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3571 conditions, 1728 events. 1016/1728 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 10031 event pairs, 96 based on Foata normal form. 60/1777 useless extension candidates. Maximal degree in co-relation 3563. Up to 1015 conditions per place. [2024-10-11 19:39:43,787 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 37 selfloop transitions, 5 changer transitions 1/54 dead transitions. [2024-10-11 19:39:43,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 214 flow [2024-10-11 19:39:43,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:39:43,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:39:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-10-11 19:39:43,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-10-11 19:39:43,789 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 78 flow. Second operand 4 states and 105 transitions. [2024-10-11 19:39:43,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 214 flow [2024-10-11 19:39:43,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:39:43,790 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 111 flow [2024-10-11 19:39:43,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-10-11 19:39:43,790 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -21 predicate places. [2024-10-11 19:39:43,791 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 111 flow [2024-10-11 19:39:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:43,791 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:43,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 19:39:43,791 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1347900858, now seen corresponding path program 1 times [2024-10-11 19:39:43,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:43,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750693978] [2024-10-11 19:39:43,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:43,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:43,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:43,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:43,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750693978] [2024-10-11 19:39:43,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750693978] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:43,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:43,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:39:43,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006609742] [2024-10-11 19:39:43,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:43,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:39:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:43,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:39:43,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:39:43,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2024-10-11 19:39:43,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:43,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:43,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2024-10-11 19:39:43,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:44,067 INFO L124 PetriNetUnfolderBase]: 690/1198 cut-off events. [2024-10-11 19:39:44,068 INFO L125 PetriNetUnfolderBase]: For 325/325 co-relation queries the response was YES. [2024-10-11 19:39:44,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2898 conditions, 1198 events. 690/1198 cut-off events. For 325/325 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6108 event pairs, 36 based on Foata normal form. 54/1241 useless extension candidates. Maximal degree in co-relation 2887. Up to 553 conditions per place. [2024-10-11 19:39:44,073 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 46 selfloop transitions, 8 changer transitions 1/66 dead transitions. [2024-10-11 19:39:44,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 66 transitions, 308 flow [2024-10-11 19:39:44,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:39:44,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:39:44,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2024-10-11 19:39:44,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4 [2024-10-11 19:39:44,074 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 111 flow. Second operand 5 states and 132 transitions. [2024-10-11 19:39:44,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 66 transitions, 308 flow [2024-10-11 19:39:44,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 66 transitions, 298 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 19:39:44,076 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 151 flow [2024-10-11 19:39:44,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2024-10-11 19:39:44,077 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -17 predicate places. [2024-10-11 19:39:44,077 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 151 flow [2024-10-11 19:39:44,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.8) internal successors, (89), 5 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:44,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:44,078 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:44,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 19:39:44,078 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:44,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 268094148, now seen corresponding path program 1 times [2024-10-11 19:39:44,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:44,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028461252] [2024-10-11 19:39:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:44,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:44,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:44,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:44,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028461252] [2024-10-11 19:39:44,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028461252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:44,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:44,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:39:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415989424] [2024-10-11 19:39:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:44,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:39:44,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:44,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:39:44,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:39:44,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2024-10-11 19:39:44,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:44,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:44,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2024-10-11 19:39:44,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:44,462 INFO L124 PetriNetUnfolderBase]: 371/641 cut-off events. [2024-10-11 19:39:44,463 INFO L125 PetriNetUnfolderBase]: For 568/568 co-relation queries the response was YES. [2024-10-11 19:39:44,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 641 events. 371/641 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2578 event pairs, 25 based on Foata normal form. 32/662 useless extension candidates. Maximal degree in co-relation 1779. Up to 228 conditions per place. [2024-10-11 19:39:44,466 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 41 selfloop transitions, 11 changer transitions 1/64 dead transitions. [2024-10-11 19:39:44,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 64 transitions, 321 flow [2024-10-11 19:39:44,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:39:44,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:39:44,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-10-11 19:39:44,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3661616161616162 [2024-10-11 19:39:44,467 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 151 flow. Second operand 6 states and 145 transitions. [2024-10-11 19:39:44,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 64 transitions, 321 flow [2024-10-11 19:39:44,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 64 transitions, 296 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-11 19:39:44,472 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 165 flow [2024-10-11 19:39:44,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-10-11 19:39:44,473 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2024-10-11 19:39:44,473 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 165 flow [2024-10-11 19:39:44,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:44,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:44,474 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:44,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 19:39:44,474 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1722642555, now seen corresponding path program 1 times [2024-10-11 19:39:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43576274] [2024-10-11 19:39:44,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:44,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:44,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:45,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 19:39:45,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43576274] [2024-10-11 19:39:45,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43576274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:45,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:45,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 19:39:45,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408138451] [2024-10-11 19:39:45,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:45,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 19:39:45,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 19:39:45,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 19:39:45,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-11 19:39:45,536 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2024-10-11 19:39:45,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 165 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:45,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:45,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2024-10-11 19:39:45,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:45,924 INFO L124 PetriNetUnfolderBase]: 568/1137 cut-off events. [2024-10-11 19:39:45,925 INFO L125 PetriNetUnfolderBase]: For 649/657 co-relation queries the response was YES. [2024-10-11 19:39:45,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2815 conditions, 1137 events. 568/1137 cut-off events. For 649/657 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6441 event pairs, 76 based on Foata normal form. 16/1116 useless extension candidates. Maximal degree in co-relation 2801. Up to 268 conditions per place. [2024-10-11 19:39:45,929 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 26 selfloop transitions, 3 changer transitions 39/87 dead transitions. [2024-10-11 19:39:45,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 87 transitions, 423 flow [2024-10-11 19:39:45,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 19:39:45,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-10-11 19:39:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 240 transitions. [2024-10-11 19:39:45,931 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36363636363636365 [2024-10-11 19:39:45,931 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 165 flow. Second operand 10 states and 240 transitions. [2024-10-11 19:39:45,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 87 transitions, 423 flow [2024-10-11 19:39:45,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 87 transitions, 351 flow, removed 18 selfloop flow, removed 8 redundant places. [2024-10-11 19:39:45,935 INFO L231 Difference]: Finished difference. Result has 66 places, 39 transitions, 139 flow [2024-10-11 19:39:45,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=139, PETRI_PLACES=66, PETRI_TRANSITIONS=39} [2024-10-11 19:39:45,935 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -5 predicate places. [2024-10-11 19:39:45,935 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 39 transitions, 139 flow [2024-10-11 19:39:45,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:45,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:45,936 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:45,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 19:39:45,936 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:45,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:45,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1802530839, now seen corresponding path program 2 times [2024-10-11 19:39:45,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 19:39:45,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790943419] [2024-10-11 19:39:45,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:45,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 19:39:45,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:39:46,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:39:46,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:39:46,111 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 19:39:46,111 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:39:46,112 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (46 of 47 remaining) [2024-10-11 19:39:46,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2024-10-11 19:39:46,113 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2024-10-11 19:39:46,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2024-10-11 19:39:46,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2024-10-11 19:39:46,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 47 remaining) [2024-10-11 19:39:46,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2024-10-11 19:39:46,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2024-10-11 19:39:46,114 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2024-10-11 19:39:46,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2024-10-11 19:39:46,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2024-10-11 19:39:46,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2024-10-11 19:39:46,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2024-10-11 19:39:46,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2024-10-11 19:39:46,115 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2024-10-11 19:39:46,116 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 47 remaining) [2024-10-11 19:39:46,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2024-10-11 19:39:46,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2024-10-11 19:39:46,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2024-10-11 19:39:46,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (21 of 47 remaining) [2024-10-11 19:39:46,117 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2024-10-11 19:39:46,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2024-10-11 19:39:46,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2024-10-11 19:39:46,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2024-10-11 19:39:46,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 47 remaining) [2024-10-11 19:39:46,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2024-10-11 19:39:46,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2024-10-11 19:39:46,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2024-10-11 19:39:46,120 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2024-10-11 19:39:46,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 19:39:46,121 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:46,214 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:39:46,215 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:39:46,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:39:46 BasicIcfg [2024-10-11 19:39:46,227 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:39:46,228 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:39:46,228 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:39:46,228 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:39:46,228 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:40" (3/4) ... [2024-10-11 19:39:46,230 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:39:46,231 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:39:46,235 INFO L158 Benchmark]: Toolchain (without parser) took 7386.12ms. Allocated memory was 184.5MB in the beginning and 440.4MB in the end (delta: 255.9MB). Free memory was 130.6MB in the beginning and 371.3MB in the end (delta: -240.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-10-11 19:39:46,236 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:39:46,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 549.76ms. Allocated memory is still 184.5MB. Free memory was 129.9MB in the beginning and 105.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-11 19:39:46,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.99ms. Allocated memory is still 184.5MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:39:46,236 INFO L158 Benchmark]: Boogie Preprocessor took 44.29ms. Allocated memory is still 184.5MB. Free memory was 102.8MB in the beginning and 99.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:39:46,237 INFO L158 Benchmark]: RCFGBuilder took 1062.70ms. Allocated memory is still 184.5MB. Free memory was 99.3MB in the beginning and 98.2MB in the end (delta: 1.1MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2024-10-11 19:39:46,237 INFO L158 Benchmark]: TraceAbstraction took 5681.58ms. Allocated memory was 184.5MB in the beginning and 440.4MB in the end (delta: 255.9MB). Free memory was 97.2MB in the beginning and 371.3MB in the end (delta: -274.1MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. [2024-10-11 19:39:46,237 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 440.4MB. Free memory is still 371.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:39:46,238 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 184.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 549.76ms. Allocated memory is still 184.5MB. Free memory was 129.9MB in the beginning and 105.6MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.99ms. Allocated memory is still 184.5MB. Free memory was 104.9MB in the beginning and 102.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.29ms. Allocated memory is still 184.5MB. Free memory was 102.8MB in the beginning and 99.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1062.70ms. Allocated memory is still 184.5MB. Free memory was 99.3MB in the beginning and 98.2MB in the end (delta: 1.1MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5681.58ms. Allocated memory was 184.5MB in the beginning and 440.4MB in the end (delta: 255.9MB). Free memory was 97.2MB in the beginning and 371.3MB in the end (delta: -274.1MB). Peak memory consumption was 169.4MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 440.4MB. Free memory is still 371.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2213=-3, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] 0 pthread_t t2214; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213=-3, t2214=-2, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L835] 0 pthread_t t2215; [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213=-3, t2214=-2, t2215=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L803] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213=-3, t2214=-2, t2215=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213=-3, t2214=-2, t2215=-1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213=-3, t2214=-2, t2215=-1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe018_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 106 locations, 47 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: 5.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 390 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 373 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 632 IncrementalHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 11 mSDtfsCounter, 632 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=165occurred in iteration=9, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 871 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:39:46,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 19:39:48,369 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 19:39:48,442 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-11 19:39:48,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 19:39:48,448 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 19:39:48,475 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 19:39:48,476 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 19:39:48,476 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 19:39:48,476 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 19:39:48,478 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 19:39:48,478 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 19:39:48,478 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 19:39:48,479 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 19:39:48,479 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 19:39:48,481 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 19:39:48,482 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 19:39:48,482 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 19:39:48,482 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 19:39:48,482 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 19:39:48,482 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 19:39:48,482 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 19:39:48,483 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 19:39:48,483 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 19:39:48,483 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 19:39:48,483 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 19:39:48,483 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 19:39:48,484 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 19:39:48,484 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 19:39:48,484 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 19:39:48,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 19:39:48,485 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 19:39:48,485 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 19:39:48,485 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 19:39:48,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 19:39:48,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 19:39:48,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:39:48,486 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 19:39:48,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 19:39:48,487 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 19:39:48,487 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 19:39:48,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 19:39:48,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 19:39:48,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 19:39:48,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 19:39:48,488 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 19:39:48,488 INFO L153 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 6f413b41672ef8cb3f594e0d22a82a07ab4d735f8bfa69fff7e94198d51bd0eb [2024-10-11 19:39:48,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 19:39:48,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 19:39:48,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 19:39:48,823 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 19:39:48,824 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 19:39:48,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2024-10-11 19:39:50,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 19:39:50,538 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 19:39:50,538 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_rmo.oepc.i [2024-10-11 19:39:50,555 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4f80037c0/2e5b9c6cbedd4b85ba3f62925217c190/FLAGb9f12818a [2024-10-11 19:39:50,815 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4f80037c0/2e5b9c6cbedd4b85ba3f62925217c190 [2024-10-11 19:39:50,817 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 19:39:50,818 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 19:39:50,820 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 19:39:50,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 19:39:50,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 19:39:50,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:50" (1/1) ... [2024-10-11 19:39:50,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b19a50a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:50, skipping insertion in model container [2024-10-11 19:39:50,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:39:50" (1/1) ... [2024-10-11 19:39:50,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 19:39:51,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:39:51,186 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 19:39:51,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 19:39:51,342 INFO L204 MainTranslator]: Completed translation [2024-10-11 19:39:51,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51 WrapperNode [2024-10-11 19:39:51,343 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 19:39:51,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 19:39:51,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 19:39:51,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 19:39:51,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,374 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,399 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-10-11 19:39:51,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 19:39:51,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 19:39:51,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 19:39:51,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 19:39:51,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,415 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,438 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-10-11 19:39:51,442 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,442 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,454 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,458 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,464 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,466 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,469 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 19:39:51,473 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 19:39:51,473 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 19:39:51,473 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 19:39:51,474 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (1/1) ... [2024-10-11 19:39:51,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 19:39:51,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 19:39:51,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 19:39:51,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 19:39:51,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-11 19:39:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-11 19:39:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-11 19:39:51,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 19:39:51,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 19:39:51,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 19:39:51,539 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 19:39:51,699 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 19:39:51,701 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 19:39:52,122 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 19:39:52,122 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 19:39:52,545 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 19:39:52,546 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 19:39:52,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:52 BoogieIcfgContainer [2024-10-11 19:39:52,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 19:39:52,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 19:39:52,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 19:39:52,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 19:39:52,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:39:50" (1/3) ... [2024-10-11 19:39:52,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185aa4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:52, skipping insertion in model container [2024-10-11 19:39:52,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:39:51" (2/3) ... [2024-10-11 19:39:52,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@185aa4c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:39:52, skipping insertion in model container [2024-10-11 19:39:52,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:52" (3/3) ... [2024-10-11 19:39:52,553 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.oepc.i [2024-10-11 19:39:52,566 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 19:39:52,566 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-11 19:39:52,566 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 19:39:52,638 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-11 19:39:52,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 74 places, 66 transitions, 144 flow [2024-10-11 19:39:52,687 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2024-10-11 19:39:52,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:52,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 204 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 65. Up to 2 conditions per place. [2024-10-11 19:39:52,691 INFO L82 GeneralOperation]: Start removeDead. Operand has 74 places, 66 transitions, 144 flow [2024-10-11 19:39:52,694 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 71 places, 63 transitions, 135 flow [2024-10-11 19:39:52,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 19:39:52,705 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@3cc97b98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 19:39:52,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-11 19:39:52,723 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 19:39:52,723 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-11 19:39:52,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:52,724 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:52,724 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:39:52,724 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:52,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:52,728 INFO L85 PathProgramCache]: Analyzing trace with hash 18054032, now seen corresponding path program 1 times [2024-10-11 19:39:52,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:52,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105517860] [2024-10-11 19:39:52,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:52,738 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 [2024-10-11 19:39:52,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:52,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:52,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:52,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:39:52,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:52,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:52,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:52,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105517860] [2024-10-11 19:39:52,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105517860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:52,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723784123] [2024-10-11 19:39:52,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:52,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:52,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:52,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:52,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:52,911 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:52,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 63 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:52,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:52,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:52,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:53,392 INFO L124 PetriNetUnfolderBase]: 1505/2566 cut-off events. [2024-10-11 19:39:53,392 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:53,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4855 conditions, 2566 events. 1505/2566 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 18679 event pairs, 1505 based on Foata normal form. 112/1906 useless extension candidates. Maximal degree in co-relation 4844. Up to 2258 conditions per place. [2024-10-11 19:39:53,416 INFO L140 encePairwiseOnDemand]: 47/66 looper letters, 27 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2024-10-11 19:39:53,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 44 transitions, 153 flow [2024-10-11 19:39:53,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:53,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:53,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2024-10-11 19:39:53,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5202020202020202 [2024-10-11 19:39:53,429 INFO L175 Difference]: Start difference. First operand has 71 places, 63 transitions, 135 flow. Second operand 3 states and 103 transitions. [2024-10-11 19:39:53,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 44 transitions, 153 flow [2024-10-11 19:39:53,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 150 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 19:39:53,435 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 96 flow [2024-10-11 19:39:53,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-10-11 19:39:53,439 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -18 predicate places. [2024-10-11 19:39:53,440 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 96 flow [2024-10-11 19:39:53,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:53,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:53,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-11 19:39:53,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:53,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:53,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash 18054033, now seen corresponding path program 1 times [2024-10-11 19:39:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:53,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1259766818] [2024-10-11 19:39:53,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:53,644 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 [2024-10-11 19:39:53,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:53,648 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:53,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:53,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:53,752 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:39:53,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:53,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:53,792 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:53,792 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1259766818] [2024-10-11 19:39:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1259766818] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:53,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:53,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:53,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616102112] [2024-10-11 19:39:53,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:53,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:53,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:53,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:53,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:53,795 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:53,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:53,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:53,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:53,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:53,984 INFO L124 PetriNetUnfolderBase]: 501/938 cut-off events. [2024-10-11 19:39:53,985 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:53,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 938 events. 501/938 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 6116 event pairs, 501 based on Foata normal form. 0/865 useless extension candidates. Maximal degree in co-relation 1740. Up to 784 conditions per place. [2024-10-11 19:39:53,991 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 20 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-10-11 19:39:53,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 128 flow [2024-10-11 19:39:53,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:53,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-10-11 19:39:53,994 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4292929292929293 [2024-10-11 19:39:53,994 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 96 flow. Second operand 3 states and 85 transitions. [2024-10-11 19:39:53,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 128 flow [2024-10-11 19:39:53,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 127 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:39:53,995 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 83 flow [2024-10-11 19:39:53,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=83, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-10-11 19:39:53,996 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -23 predicate places. [2024-10-11 19:39:53,997 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 83 flow [2024-10-11 19:39:53,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:53,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:53,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:54,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 19:39:54,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:54,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:54,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -842249588, now seen corresponding path program 1 times [2024-10-11 19:39:54,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:54,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569121216] [2024-10-11 19:39:54,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:54,203 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 [2024-10-11 19:39:54,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:54,206 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:54,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:54,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 19:39:54,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:54,368 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:54,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:54,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569121216] [2024-10-11 19:39:54,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569121216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:54,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:54,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 19:39:54,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117170881] [2024-10-11 19:39:54,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:39:54,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:54,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:39:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:39:54,374 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2024-10-11 19:39:54,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:54,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:54,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2024-10-11 19:39:54,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:54,677 INFO L124 PetriNetUnfolderBase]: 1361/2289 cut-off events. [2024-10-11 19:39:54,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:54,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4388 conditions, 2289 events. 1361/2289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 13990 event pairs, 96 based on Foata normal form. 60/2230 useless extension candidates. Maximal degree in co-relation 4381. Up to 1522 conditions per place. [2024-10-11 19:39:54,687 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 40 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-10-11 19:39:54,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 58 transitions, 221 flow [2024-10-11 19:39:54,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:39:54,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:39:54,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-11 19:39:54,689 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-10-11 19:39:54,689 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 83 flow. Second operand 4 states and 108 transitions. [2024-10-11 19:39:54,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 58 transitions, 221 flow [2024-10-11 19:39:54,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 58 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:39:54,691 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 116 flow [2024-10-11 19:39:54,691 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-10-11 19:39:54,692 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2024-10-11 19:39:54,692 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 116 flow [2024-10-11 19:39:54,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:54,692 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:54,692 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:54,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:54,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:54,894 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:54,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:54,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1875817230, now seen corresponding path program 1 times [2024-10-11 19:39:54,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:54,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486604861] [2024-10-11 19:39:54,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:54,895 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 [2024-10-11 19:39:54,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:54,898 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:54,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:55,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:39:55,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:55,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:55,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:55,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:55,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486604861] [2024-10-11 19:39:55,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486604861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:55,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:55,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 19:39:55,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547667381] [2024-10-11 19:39:55,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:55,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 19:39:55,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:55,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 19:39:55,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 19:39:55,113 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2024-10-11 19:39:55,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:55,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:55,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2024-10-11 19:39:55,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:55,421 INFO L124 PetriNetUnfolderBase]: 870/1506 cut-off events. [2024-10-11 19:39:55,421 INFO L125 PetriNetUnfolderBase]: For 361/361 co-relation queries the response was YES. [2024-10-11 19:39:55,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3369 conditions, 1506 events. 870/1506 cut-off events. For 361/361 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8101 event pairs, 36 based on Foata normal form. 54/1485 useless extension candidates. Maximal degree in co-relation 3359. Up to 829 conditions per place. [2024-10-11 19:39:55,431 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 49 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-10-11 19:39:55,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 70 transitions, 313 flow [2024-10-11 19:39:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 19:39:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-11 19:39:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2024-10-11 19:39:55,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4090909090909091 [2024-10-11 19:39:55,433 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 116 flow. Second operand 5 states and 135 transitions. [2024-10-11 19:39:55,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 70 transitions, 313 flow [2024-10-11 19:39:55,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 303 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-11 19:39:55,436 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 156 flow [2024-10-11 19:39:55,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2024-10-11 19:39:55,437 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -16 predicate places. [2024-10-11 19:39:55,437 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 156 flow [2024-10-11 19:39:55,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:55,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:55,437 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:55,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 19:39:55,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:55,640 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:55,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:55,641 INFO L85 PathProgramCache]: Analyzing trace with hash -535519026, now seen corresponding path program 1 times [2024-10-11 19:39:55,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:55,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8987009] [2024-10-11 19:39:55,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:55,642 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 [2024-10-11 19:39:55,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:55,644 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:55,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:55,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 19:39:55,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:55,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:55,781 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:55,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:55,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8987009] [2024-10-11 19:39:55,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8987009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:55,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:55,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:39:55,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043117042] [2024-10-11 19:39:55,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:55,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:39:55,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:55,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:39:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:39:55,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 66 [2024-10-11 19:39:55,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:55,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:55,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 66 [2024-10-11 19:39:55,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:56,039 INFO L124 PetriNetUnfolderBase]: 407/709 cut-off events. [2024-10-11 19:39:56,039 INFO L125 PetriNetUnfolderBase]: For 568/568 co-relation queries the response was YES. [2024-10-11 19:39:56,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 709 events. 407/709 cut-off events. For 568/568 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2918 event pairs, 25 based on Foata normal form. 32/714 useless extension candidates. Maximal degree in co-relation 1823. Up to 228 conditions per place. [2024-10-11 19:39:56,043 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 44 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-10-11 19:39:56,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 68 transitions, 328 flow [2024-10-11 19:39:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:39:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:39:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2024-10-11 19:39:56,048 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-10-11 19:39:56,048 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 156 flow. Second operand 6 states and 148 transitions. [2024-10-11 19:39:56,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 68 transitions, 328 flow [2024-10-11 19:39:56,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 303 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-11 19:39:56,052 INFO L231 Difference]: Finished difference. Result has 58 places, 43 transitions, 170 flow [2024-10-11 19:39:56,052 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=170, PETRI_PLACES=58, PETRI_TRANSITIONS=43} [2024-10-11 19:39:56,053 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -13 predicate places. [2024-10-11 19:39:56,053 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 43 transitions, 170 flow [2024-10-11 19:39:56,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.333333333333332) internal successors, (104), 6 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:56,053 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:56,053 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:56,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:56,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:56,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:56,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -635091333, now seen corresponding path program 1 times [2024-10-11 19:39:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1692090632] [2024-10-11 19:39:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:56,256 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 [2024-10-11 19:39:56,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:56,259 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:56,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:56,354 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 19:39:56,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:56,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:56,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1692090632] [2024-10-11 19:39:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1692090632] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:56,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:56,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:39:56,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530539357] [2024-10-11 19:39:56,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:56,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:39:56,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:56,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:39:56,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:39:56,528 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:56,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 43 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:56,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:56,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:56,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:56,620 INFO L124 PetriNetUnfolderBase]: 227/493 cut-off events. [2024-10-11 19:39:56,620 INFO L125 PetriNetUnfolderBase]: For 249/253 co-relation queries the response was YES. [2024-10-11 19:39:56,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 493 events. 227/493 cut-off events. For 249/253 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2254 event pairs, 118 based on Foata normal form. 0/456 useless extension candidates. Maximal degree in co-relation 1094. Up to 301 conditions per place. [2024-10-11 19:39:56,623 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 27 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-11 19:39:56,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 51 transitions, 248 flow [2024-10-11 19:39:56,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:39:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:39:56,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-10-11 19:39:56,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4015151515151515 [2024-10-11 19:39:56,624 INFO L175 Difference]: Start difference. First operand has 58 places, 43 transitions, 170 flow. Second operand 4 states and 106 transitions. [2024-10-11 19:39:56,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 51 transitions, 248 flow [2024-10-11 19:39:56,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 192 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-10-11 19:39:56,627 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 116 flow [2024-10-11 19:39:56,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2024-10-11 19:39:56,627 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2024-10-11 19:39:56,627 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 116 flow [2024-10-11 19:39:56,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:56,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:56,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:56,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-10-11 19:39:56,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:56,832 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:56,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:56,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1052681270, now seen corresponding path program 1 times [2024-10-11 19:39:56,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:56,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673106425] [2024-10-11 19:39:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:56,833 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 [2024-10-11 19:39:56,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:56,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:56,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:56,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:39:56,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:57,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:57,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:57,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673106425] [2024-10-11 19:39:57,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1673106425] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:57,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:57,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 19:39:57,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146915861] [2024-10-11 19:39:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:57,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 19:39:57,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:57,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 19:39:57,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 19:39:57,067 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 66 [2024-10-11 19:39:57,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:57,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:57,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 66 [2024-10-11 19:39:57,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:57,165 INFO L124 PetriNetUnfolderBase]: 215/473 cut-off events. [2024-10-11 19:39:57,165 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 19:39:57,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 473 events. 215/473 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2159 event pairs, 106 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 900. Up to 281 conditions per place. [2024-10-11 19:39:57,168 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 26 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2024-10-11 19:39:57,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 192 flow [2024-10-11 19:39:57,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 19:39:57,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 19:39:57,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-10-11 19:39:57,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3977272727272727 [2024-10-11 19:39:57,169 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 116 flow. Second operand 4 states and 105 transitions. [2024-10-11 19:39:57,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 192 flow [2024-10-11 19:39:57,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:39:57,170 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 115 flow [2024-10-11 19:39:57,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2024-10-11 19:39:57,171 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -19 predicate places. [2024-10-11 19:39:57,171 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 115 flow [2024-10-11 19:39:57,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:57,171 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:57,171 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:57,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-11 19:39:57,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:57,372 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:57,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:57,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1160584483, now seen corresponding path program 1 times [2024-10-11 19:39:57,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:57,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641506926] [2024-10-11 19:39:57,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:57,373 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 [2024-10-11 19:39:57,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:57,376 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:57,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:57,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 19:39:57,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:57,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:57,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:57,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:57,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641506926] [2024-10-11 19:39:57,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641506926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:57,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:57,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 19:39:57,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498929242] [2024-10-11 19:39:57,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:57,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 19:39:57,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:57,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 19:39:57,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 19:39:57,509 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 66 [2024-10-11 19:39:57,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:57,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:57,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 66 [2024-10-11 19:39:57,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:57,569 INFO L124 PetriNetUnfolderBase]: 195/413 cut-off events. [2024-10-11 19:39:57,569 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 19:39:57,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 849 conditions, 413 events. 195/413 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1847 event pairs, 180 based on Foata normal form. 8/387 useless extension candidates. Maximal degree in co-relation 840. Up to 315 conditions per place. [2024-10-11 19:39:57,571 INFO L140 encePairwiseOnDemand]: 64/66 looper letters, 17 selfloop transitions, 1 changer transitions 1/40 dead transitions. [2024-10-11 19:39:57,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 40 transitions, 151 flow [2024-10-11 19:39:57,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 19:39:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 19:39:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2024-10-11 19:39:57,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37373737373737376 [2024-10-11 19:39:57,573 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 115 flow. Second operand 3 states and 74 transitions. [2024-10-11 19:39:57,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 40 transitions, 151 flow [2024-10-11 19:39:57,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 40 transitions, 148 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 19:39:57,574 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 110 flow [2024-10-11 19:39:57,575 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2024-10-11 19:39:57,576 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -20 predicate places. [2024-10-11 19:39:57,576 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 110 flow [2024-10-11 19:39:57,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:57,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:57,577 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:57,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-11 19:39:57,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:57,781 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:57,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:57,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1664996907, now seen corresponding path program 1 times [2024-10-11 19:39:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:57,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412717067] [2024-10-11 19:39:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 19:39:57,786 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 [2024-10-11 19:39:57,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:57,788 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:57,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 19:39:57,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:39:57,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:57,955 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:57,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:57,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412717067] [2024-10-11 19:39:57,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412717067] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:57,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:57,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 19:39:57,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471567423] [2024-10-11 19:39:57,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:57,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:39:57,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:57,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:39:57,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:39:57,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2024-10-11 19:39:57,970 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 110 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:57,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:57,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2024-10-11 19:39:57,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:58,173 INFO L124 PetriNetUnfolderBase]: 442/885 cut-off events. [2024-10-11 19:39:58,173 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 19:39:58,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 885 events. 442/885 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 4639 event pairs, 83 based on Foata normal form. 8/862 useless extension candidates. Maximal degree in co-relation 1827. Up to 284 conditions per place. [2024-10-11 19:39:58,177 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 26 selfloop transitions, 3 changer transitions 17/65 dead transitions. [2024-10-11 19:39:58,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 65 transitions, 260 flow [2024-10-11 19:39:58,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:39:58,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:39:58,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-11 19:39:58,179 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37626262626262624 [2024-10-11 19:39:58,179 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 110 flow. Second operand 6 states and 149 transitions. [2024-10-11 19:39:58,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 65 transitions, 260 flow [2024-10-11 19:39:58,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 65 transitions, 259 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 19:39:58,180 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 123 flow [2024-10-11 19:39:58,180 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-10-11 19:39:58,181 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -14 predicate places. [2024-10-11 19:39:58,181 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 123 flow [2024-10-11 19:39:58,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:58,181 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:58,182 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:58,187 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-11 19:39:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:58,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 473171203, now seen corresponding path program 2 times [2024-10-11 19:39:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607766420] [2024-10-11 19:39:58,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 19:39:58,384 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 [2024-10-11 19:39:58,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:58,385 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:58,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:58,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 19:39:58,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 19:39:58,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 19:39:58,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 19:39:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 19:39:58,541 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 19:39:58,541 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 19:39:58,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607766420] [2024-10-11 19:39:58,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607766420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 19:39:58,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 19:39:58,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 19:39:58,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81760689] [2024-10-11 19:39:58,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 19:39:58,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 19:39:58,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 19:39:58,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 19:39:58,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 19:39:58,551 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 66 [2024-10-11 19:39:58,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 123 flow. Second operand has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:58,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 19:39:58,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 66 [2024-10-11 19:39:58,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 19:39:58,739 INFO L124 PetriNetUnfolderBase]: 398/828 cut-off events. [2024-10-11 19:39:58,739 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-10-11 19:39:58,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1746 conditions, 828 events. 398/828 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4301 event pairs, 127 based on Foata normal form. 8/800 useless extension candidates. Maximal degree in co-relation 1733. Up to 336 conditions per place. [2024-10-11 19:39:58,743 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 23 selfloop transitions, 1 changer transitions 20/63 dead transitions. [2024-10-11 19:39:58,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 269 flow [2024-10-11 19:39:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 19:39:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 19:39:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 147 transitions. [2024-10-11 19:39:58,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3712121212121212 [2024-10-11 19:39:58,744 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 123 flow. Second operand 6 states and 147 transitions. [2024-10-11 19:39:58,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 269 flow [2024-10-11 19:39:58,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 63 transitions, 253 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-11 19:39:58,745 INFO L231 Difference]: Finished difference. Result has 59 places, 39 transitions, 122 flow [2024-10-11 19:39:58,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=59, PETRI_TRANSITIONS=39} [2024-10-11 19:39:58,746 INFO L277 CegarLoopForPetriNet]: 71 programPoint places, -12 predicate places. [2024-10-11 19:39:58,746 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 39 transitions, 122 flow [2024-10-11 19:39:58,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.833333333333332) internal successors, (119), 6 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 19:39:58,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 19:39:58,746 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:58,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-11 19:39:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:58,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-11 19:39:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 19:39:58,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2054462929, now seen corresponding path program 3 times [2024-10-11 19:39:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 19:39:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237293854] [2024-10-11 19:39:58,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 19:39:58,951 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 [2024-10-11 19:39:58,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 19:39:58,954 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/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) [2024-10-11 19:39:58,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:59,061 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-10-11 19:39:59,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-11 19:39:59,061 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 19:39:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 19:39:59,221 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-11 19:39:59,225 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 19:39:59,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (46 of 47 remaining) [2024-10-11 19:39:59,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2024-10-11 19:39:59,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2024-10-11 19:39:59,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2024-10-11 19:39:59,232 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2024-10-11 19:39:59,233 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (21 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2024-10-11 19:39:59,234 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2024-10-11 19:39:59,235 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2024-10-11 19:39:59,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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 [2024-10-11 19:39:59,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/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 [2024-10-11 19:39:59,436 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 19:39:59,509 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 19:39:59,509 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 19:39:59,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:39:59 BasicIcfg [2024-10-11 19:39:59,518 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 19:39:59,519 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 19:39:59,519 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 19:39:59,519 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 19:39:59,520 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:39:52" (3/4) ... [2024-10-11 19:39:59,521 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 19:39:59,523 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 19:39:59,523 INFO L158 Benchmark]: Toolchain (without parser) took 8705.21ms. Allocated memory was 75.5MB in the beginning and 339.7MB in the end (delta: 264.2MB). Free memory was 52.3MB in the beginning and 210.8MB in the end (delta: -158.5MB). Peak memory consumption was 106.4MB. Max. memory is 16.1GB. [2024-10-11 19:39:59,526 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:39:59,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 522.98ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 46.2MB in the end (delta: 5.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-11 19:39:59,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.60ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 19:39:59,527 INFO L158 Benchmark]: Boogie Preprocessor took 69.14ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 40.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 19:39:59,527 INFO L158 Benchmark]: RCFGBuilder took 1073.31ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 40.2MB in the beginning and 71.1MB in the end (delta: -30.8MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-10-11 19:39:59,527 INFO L158 Benchmark]: TraceAbstraction took 6970.75ms. Allocated memory was 98.6MB in the beginning and 339.7MB in the end (delta: 241.2MB). Free memory was 70.3MB in the beginning and 210.8MB in the end (delta: -140.5MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. [2024-10-11 19:39:59,528 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 339.7MB. Free memory is still 210.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 19:39:59,529 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 33.6MB in the beginning and 33.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 522.98ms. Allocated memory is still 75.5MB. Free memory was 52.1MB in the beginning and 46.2MB in the end (delta: 5.9MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.60ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 43.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.14ms. Allocated memory is still 75.5MB. Free memory was 43.7MB in the beginning and 40.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1073.31ms. Allocated memory was 75.5MB in the beginning and 98.6MB in the end (delta: 23.1MB). Free memory was 40.2MB in the beginning and 71.1MB in the end (delta: -30.8MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6970.75ms. Allocated memory was 98.6MB in the beginning and 339.7MB in the end (delta: 241.2MB). Free memory was 70.3MB in the beginning and 210.8MB in the end (delta: -140.5MB). Peak memory consumption was 100.1MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 339.7MB. Free memory is still 210.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2213; [L832] FCALL, FORK 0 pthread_create(&t2213, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2213=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L833] 0 pthread_t t2214; [L834] FCALL, FORK 0 pthread_create(&t2214, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213=-1, t2214=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L835] 0 pthread_t t2215; [L779] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] FCALL, FORK 0 pthread_create(&t2215, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2213=-1, t2214=0, t2215=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L803] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 \read(y) [L809] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L809] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L809] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L810] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L811] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L812] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L813] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213=-1, t2214=0, t2215=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 \read(y) [L842] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L842] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L842] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L843] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L844] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L845] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L846] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213=-1, t2214=0, t2215=1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L849] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L850] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L850] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L850] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L851] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2213=-1, t2214=0, t2215=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe018_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 834]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 106 locations, 47 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: 6.8s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 314 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 795 IncrementalHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 13 mSDtfsCounter, 795 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=170occurred in iteration=5, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 220 NumberOfCodeBlocks, 220 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 181 ConstructedInterpolants, 0 QuantifiedInterpolants, 960 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1328 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 19:39:59,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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