./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-wmm/safe018_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe018_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:01:03,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:01:04,040 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 18:01:04,045 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:01:04,046 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:01:04,075 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:01:04,076 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:01:04,076 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:01:04,077 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:01:04,078 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:01:04,078 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:01:04,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:01:04,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:01:04,081 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:01:04,081 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:01:04,081 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:01:04,081 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:01:04,082 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:01:04,082 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:01:04,082 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:01:04,085 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:01:04,085 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:01:04,085 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:01:04,086 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:01:04,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:01:04,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:01:04,086 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:01:04,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:01:04,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:01:04,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:01:04,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:01:04,087 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:01:04,087 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:01:04,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:01:04,088 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:01:04,088 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:01:04,088 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 18:01:04,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 18:01:04,089 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:01:04,089 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:01:04,089 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:01:04,089 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:01:04,089 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c [2024-11-10 18:01:04,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:01:04,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:01:04,352 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:01:04,353 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:01:04,353 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:01:04,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe018_power.opt.i [2024-11-10 18:01:05,915 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:01:06,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:01:06,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_power.opt.i [2024-11-10 18:01:06,292 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33b58ef5/fc04ced80d83499698e6f13861a91f61/FLAG8b56dc95a [2024-11-10 18:01:06,312 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c33b58ef5/fc04ced80d83499698e6f13861a91f61 [2024-11-10 18:01:06,316 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:01:06,320 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:01:06,322 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:01:06,322 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:01:06,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:01:06,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:06,332 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cb40652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06, skipping insertion in model container [2024-11-10 18:01:06,332 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:06,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:01:06,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:01:06,765 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:01:06,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:01:06,913 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:01:06,914 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06 WrapperNode [2024-11-10 18:01:06,914 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:01:06,915 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:01:06,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:01:06,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:01:06,923 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:06,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:06,975 INFO L138 Inliner]: procedures = 175, calls = 64, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 170 [2024-11-10 18:01:06,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:01:06,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:01:06,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:01:06,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:01:06,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:06,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:06,994 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,022 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [22, 2]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [1, 2]. The 7 writes are split as follows [7, 0]. [2024-11-10 18:01:07,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,023 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,046 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:01:07,047 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:01:07,048 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:01:07,048 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:01:07,049 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (1/1) ... [2024-11-10 18:01:07,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:01:07,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:01:07,087 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:01:07,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:01:07,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 18:01:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 18:01:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 18:01:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 18:01:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:01:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:01:07,144 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 18:01:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 18:01:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 18:01:07,145 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 18:01:07,145 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 18:01:07,146 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 18:01:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 18:01:07,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 18:01:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:01:07,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:01:07,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:01:07,148 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:01:07,307 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:01:07,311 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:01:07,845 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:01:07,845 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:01:08,379 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-10 18:01:08,419 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-10 18:01:08,504 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-10 18:01:08,572 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:01:08,573 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:01:08,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:08 BoogieIcfgContainer [2024-11-10 18:01:08,575 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:01:08,577 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:01:08,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:01:08,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:01:08,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:01:06" (1/3) ... [2024-11-10 18:01:08,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecebe69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:08, skipping insertion in model container [2024-11-10 18:01:08,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:06" (2/3) ... [2024-11-10 18:01:08,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ecebe69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:01:08, skipping insertion in model container [2024-11-10 18:01:08,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:08" (3/3) ... [2024-11-10 18:01:08,585 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2024-11-10 18:01:08,603 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:01:08,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-10 18:01:08,603 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:01:08,774 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:01:08,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 112 transitions, 236 flow [2024-11-10 18:01:08,905 INFO L124 PetriNetUnfolderBase]: 29/109 cut-off events. [2024-11-10 18:01:08,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:01:08,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 29/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 366 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 111. Up to 4 conditions per place. [2024-11-10 18:01:08,912 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 112 transitions, 236 flow [2024-11-10 18:01:08,918 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 109 transitions, 227 flow [2024-11-10 18:01:08,929 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:01:08,935 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;@6c539d87, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:01:08,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2024-11-10 18:01:08,944 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:01:08,944 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-10 18:01:08,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:01:08,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:08,946 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:01:08,946 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:08,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash 917005710, now seen corresponding path program 1 times [2024-11-10 18:01:08,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:08,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427064475] [2024-11-10 18:01:08,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:08,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:09,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:09,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427064475] [2024-11-10 18:01:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427064475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:09,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:01:09,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564501191] [2024-11-10 18:01:09,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:09,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:09,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:09,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:09,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:09,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:09,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:01:09,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:09,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:09,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:13,896 INFO L124 PetriNetUnfolderBase]: 20549/29651 cut-off events. [2024-11-10 18:01:13,896 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-10 18:01:13,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57516 conditions, 29651 events. 20549/29651 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 192780 event pairs, 18197 based on Foata normal form. 1008/20151 useless extension candidates. Maximal degree in co-relation 57505. Up to 27732 conditions per place. [2024-11-10 18:01:14,183 INFO L140 encePairwiseOnDemand]: 53/112 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-10 18:01:14,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 195 flow [2024-11-10 18:01:14,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-10 18:01:14,196 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3898809523809524 [2024-11-10 18:01:14,198 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 227 flow. Second operand 3 states and 131 transitions. [2024-11-10 18:01:14,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 195 flow [2024-11-10 18:01:14,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:01:14,207 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 108 flow [2024-11-10 18:01:14,209 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-11-10 18:01:14,215 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -34 predicate places. [2024-11-10 18:01:14,216 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 108 flow [2024-11-10 18:01:14,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:01:14,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:14,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:01:14,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 18:01:14,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:14,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:14,218 INFO L85 PathProgramCache]: Analyzing trace with hash 917005711, now seen corresponding path program 1 times [2024-11-10 18:01:14,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:14,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062816600] [2024-11-10 18:01:14,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:14,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:14,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:14,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:14,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062816600] [2024-11-10 18:01:14,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062816600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:14,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:14,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:01:14,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709290689] [2024-11-10 18:01:14,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:14,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:14,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:14,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:14,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:14,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:14,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:01:14,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:14,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:14,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:16,135 INFO L124 PetriNetUnfolderBase]: 7691/11172 cut-off events. [2024-11-10 18:01:16,136 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:01:16,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21630 conditions, 11172 events. 7691/11172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 63300 event pairs, 6395 based on Foata normal form. 0/8949 useless extension candidates. Maximal degree in co-relation 21624. Up to 10368 conditions per place. [2024-11-10 18:01:16,181 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 34 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2024-11-10 18:01:16,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 162 flow [2024-11-10 18:01:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:16,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-10 18:01:16,185 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21726190476190477 [2024-11-10 18:01:16,185 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 108 flow. Second operand 3 states and 73 transitions. [2024-11-10 18:01:16,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 162 flow [2024-11-10 18:01:16,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:01:16,186 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 93 flow [2024-11-10 18:01:16,186 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-10 18:01:16,187 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -41 predicate places. [2024-11-10 18:01:16,187 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 93 flow [2024-11-10 18:01:16,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:01:16,187 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:16,187 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:01:16,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 18:01:16,188 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:16,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:16,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1638136534, now seen corresponding path program 1 times [2024-11-10 18:01:16,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:16,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590466229] [2024-11-10 18:01:16,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:16,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:16,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:16,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:16,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:16,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590466229] [2024-11-10 18:01:16,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590466229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:16,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:16,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:01:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834997870] [2024-11-10 18:01:16,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:16,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:16,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:16,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:16,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:16,273 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:16,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-10 18:01:16,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:16,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:16,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:18,462 INFO L124 PetriNetUnfolderBase]: 9433/13676 cut-off events. [2024-11-10 18:01:18,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:01:18,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26861 conditions, 13676 events. 9433/13676 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 81134 event pairs, 3225 based on Foata normal form. 0/12175 useless extension candidates. Maximal degree in co-relation 26854. Up to 6905 conditions per place. [2024-11-10 18:01:18,545 INFO L140 encePairwiseOnDemand]: 105/112 looper letters, 55 selfloop transitions, 3 changer transitions 2/67 dead transitions. [2024-11-10 18:01:18,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 265 flow [2024-11-10 18:01:18,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:18,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:18,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-10 18:01:18,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2024-11-10 18:01:18,547 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 93 flow. Second operand 3 states and 94 transitions. [2024-11-10 18:01:18,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 265 flow [2024-11-10 18:01:18,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:01:18,549 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 110 flow [2024-11-10 18:01:18,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-10 18:01:18,550 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -39 predicate places. [2024-11-10 18:01:18,551 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 110 flow [2024-11-10 18:01:18,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-10 18:01:18,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:18,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:18,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 18:01:18,551 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:18,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:18,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1203327277, now seen corresponding path program 1 times [2024-11-10 18:01:18,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:18,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605667494] [2024-11-10 18:01:18,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:18,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:18,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:18,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:18,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:18,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605667494] [2024-11-10 18:01:18,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605667494] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:18,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:18,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:01:18,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068987714] [2024-11-10 18:01:18,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:18,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:18,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:18,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:18,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:18,657 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:18,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-11-10 18:01:18,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:18,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:18,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:20,208 INFO L124 PetriNetUnfolderBase]: 8329/11771 cut-off events. [2024-11-10 18:01:20,209 INFO L125 PetriNetUnfolderBase]: For 1998/1998 co-relation queries the response was YES. [2024-11-10 18:01:20,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25421 conditions, 11771 events. 8329/11771 cut-off events. For 1998/1998 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 64654 event pairs, 952 based on Foata normal form. 0/10784 useless extension candidates. Maximal degree in co-relation 25411. Up to 10780 conditions per place. [2024-11-10 18:01:20,288 INFO L140 encePairwiseOnDemand]: 105/112 looper letters, 45 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-11-10 18:01:20,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 58 transitions, 250 flow [2024-11-10 18:01:20,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:20,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:20,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2024-11-10 18:01:20,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.24404761904761904 [2024-11-10 18:01:20,290 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 110 flow. Second operand 3 states and 82 transitions. [2024-11-10 18:01:20,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 58 transitions, 250 flow [2024-11-10 18:01:20,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 58 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:01:20,299 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 126 flow [2024-11-10 18:01:20,299 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-10 18:01:20,300 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -39 predicate places. [2024-11-10 18:01:20,300 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 126 flow [2024-11-10 18:01:20,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-11-10 18:01:20,301 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:20,301 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:20,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 18:01:20,301 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:20,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1051412124, now seen corresponding path program 1 times [2024-11-10 18:01:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:20,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122453295] [2024-11-10 18:01:20,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:20,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:20,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:20,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122453295] [2024-11-10 18:01:20,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122453295] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:20,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:20,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:01:20,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609475320] [2024-11-10 18:01:20,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:20,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:01:20,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:20,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:01:20,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:01:20,410 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:20,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-10 18:01:20,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:20,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:20,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:21,684 INFO L124 PetriNetUnfolderBase]: 7678/10850 cut-off events. [2024-11-10 18:01:21,684 INFO L125 PetriNetUnfolderBase]: For 1338/1338 co-relation queries the response was YES. [2024-11-10 18:01:21,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25044 conditions, 10850 events. 7678/10850 cut-off events. For 1338/1338 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 58868 event pairs, 736 based on Foata normal form. 0/10191 useless extension candidates. Maximal degree in co-relation 25033. Up to 9858 conditions per place. [2024-11-10 18:01:21,749 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 44 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-11-10 18:01:21,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 57 transitions, 258 flow [2024-11-10 18:01:21,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:01:21,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:01:21,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2024-11-10 18:01:21,751 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.20089285714285715 [2024-11-10 18:01:21,751 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 126 flow. Second operand 4 states and 90 transitions. [2024-11-10 18:01:21,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 57 transitions, 258 flow [2024-11-10 18:01:21,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:01:21,754 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 122 flow [2024-11-10 18:01:21,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-10 18:01:21,755 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -39 predicate places. [2024-11-10 18:01:21,755 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 122 flow [2024-11-10 18:01:21,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-10 18:01:21,755 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:21,756 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:21,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 18:01:21,756 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:21,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:21,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1749246527, now seen corresponding path program 1 times [2024-11-10 18:01:21,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:21,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639889659] [2024-11-10 18:01:21,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:21,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:22,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:22,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:22,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639889659] [2024-11-10 18:01:22,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639889659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:22,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:22,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:01:22,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388312669] [2024-11-10 18:01:22,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:22,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:01:22,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:22,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:01:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:01:22,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:22,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-10 18:01:22,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:22,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:22,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:24,255 INFO L124 PetriNetUnfolderBase]: 7027/9929 cut-off events. [2024-11-10 18:01:24,256 INFO L125 PetriNetUnfolderBase]: For 1308/1308 co-relation queries the response was YES. [2024-11-10 18:01:24,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22902 conditions, 9929 events. 7027/9929 cut-off events. For 1308/1308 co-relation queries the response was YES. Maximal size of possible extension queue 383. Compared 53199 event pairs, 520 based on Foata normal form. 270/9540 useless extension candidates. Maximal degree in co-relation 22891. Up to 8937 conditions per place. [2024-11-10 18:01:24,365 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 43 selfloop transitions, 6 changer transitions 0/56 dead transitions. [2024-11-10 18:01:24,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 56 transitions, 252 flow [2024-11-10 18:01:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:01:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:01:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2024-11-10 18:01:24,367 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19866071428571427 [2024-11-10 18:01:24,367 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 122 flow. Second operand 4 states and 89 transitions. [2024-11-10 18:01:24,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 56 transitions, 252 flow [2024-11-10 18:01:24,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 56 transitions, 239 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:01:24,371 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 117 flow [2024-11-10 18:01:24,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-11-10 18:01:24,372 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -40 predicate places. [2024-11-10 18:01:24,373 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 117 flow [2024-11-10 18:01:24,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-10 18:01:24,373 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:24,373 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:24,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 18:01:24,374 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:24,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1021476189, now seen corresponding path program 1 times [2024-11-10 18:01:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104813155] [2024-11-10 18:01:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:24,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:24,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:24,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104813155] [2024-11-10 18:01:24,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104813155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:24,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:24,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:01:24,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935545434] [2024-11-10 18:01:24,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:24,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:24,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:24,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:24,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:24,429 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:24,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 117 flow. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-11-10 18:01:24,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:24,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:24,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:26,647 INFO L124 PetriNetUnfolderBase]: 7027/10655 cut-off events. [2024-11-10 18:01:26,648 INFO L125 PetriNetUnfolderBase]: For 1143/1143 co-relation queries the response was YES. [2024-11-10 18:01:26,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23627 conditions, 10655 events. 7027/10655 cut-off events. For 1143/1143 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 64394 event pairs, 6379 based on Foata normal form. 300/10242 useless extension candidates. Maximal degree in co-relation 23617. Up to 9800 conditions per place. [2024-11-10 18:01:26,765 INFO L140 encePairwiseOnDemand]: 110/112 looper letters, 30 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-11-10 18:01:26,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 179 flow [2024-11-10 18:01:26,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:26,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:26,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 18:01:26,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.17559523809523808 [2024-11-10 18:01:26,767 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 117 flow. Second operand 3 states and 59 transitions. [2024-11-10 18:01:26,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 179 flow [2024-11-10 18:01:26,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:01:26,772 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 108 flow [2024-11-10 18:01:26,772 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2024-11-10 18:01:26,773 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -41 predicate places. [2024-11-10 18:01:26,774 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 108 flow [2024-11-10 18:01:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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-11-10 18:01:26,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:26,774 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:26,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 18:01:26,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1021477672, now seen corresponding path program 1 times [2024-11-10 18:01:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557428780] [2024-11-10 18:01:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:27,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:27,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:27,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557428780] [2024-11-10 18:01:27,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557428780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:27,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:27,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:01:27,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595219343] [2024-11-10 18:01:27,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:27,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:01:27,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:27,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:01:27,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:01:27,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:27,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-11-10 18:01:27,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:27,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:27,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:28,614 INFO L124 PetriNetUnfolderBase]: 8559/12661 cut-off events. [2024-11-10 18:01:28,614 INFO L125 PetriNetUnfolderBase]: For 612/612 co-relation queries the response was YES. [2024-11-10 18:01:28,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27723 conditions, 12661 events. 8559/12661 cut-off events. For 612/612 co-relation queries the response was YES. Maximal size of possible extension queue 499. Compared 74149 event pairs, 972 based on Foata normal form. 0/11804 useless extension candidates. Maximal degree in co-relation 27713. Up to 7609 conditions per place. [2024-11-10 18:01:28,672 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 38 selfloop transitions, 6 changer transitions 73/122 dead transitions. [2024-11-10 18:01:28,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 564 flow [2024-11-10 18:01:28,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:01:28,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:01:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 188 transitions. [2024-11-10 18:01:28,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.20982142857142858 [2024-11-10 18:01:28,674 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 108 flow. Second operand 8 states and 188 transitions. [2024-11-10 18:01:28,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 564 flow [2024-11-10 18:01:28,676 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 122 transitions, 563 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:01:28,677 INFO L231 Difference]: Finished difference. Result has 59 places, 36 transitions, 133 flow [2024-11-10 18:01:28,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=59, PETRI_TRANSITIONS=36} [2024-11-10 18:01:28,678 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -31 predicate places. [2024-11-10 18:01:28,678 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 36 transitions, 133 flow [2024-11-10 18:01:28,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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-11-10 18:01:28,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:28,678 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:28,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 18:01:28,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:28,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:28,679 INFO L85 PathProgramCache]: Analyzing trace with hash -705812201, now seen corresponding path program 1 times [2024-11-10 18:01:28,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:28,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133731199] [2024-11-10 18:01:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:28,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:28,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133731199] [2024-11-10 18:01:28,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133731199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:28,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:28,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:01:28,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146824876] [2024-11-10 18:01:28,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:28,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:01:28,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:28,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:01:28,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:01:28,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:28,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 36 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-10 18:01:28,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:28,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:28,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:29,940 INFO L124 PetriNetUnfolderBase]: 6501/9743 cut-off events. [2024-11-10 18:01:29,941 INFO L125 PetriNetUnfolderBase]: For 2468/2468 co-relation queries the response was YES. [2024-11-10 18:01:29,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23707 conditions, 9743 events. 6501/9743 cut-off events. For 2468/2468 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 57600 event pairs, 899 based on Foata normal form. 270/9649 useless extension candidates. Maximal degree in co-relation 23691. Up to 6991 conditions per place. [2024-11-10 18:01:29,994 INFO L140 encePairwiseOnDemand]: 107/112 looper letters, 50 selfloop transitions, 2 changer transitions 45/102 dead transitions. [2024-11-10 18:01:29,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 102 transitions, 518 flow [2024-11-10 18:01:29,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 18:01:29,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 18:01:29,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 160 transitions. [2024-11-10 18:01:29,996 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.20408163265306123 [2024-11-10 18:01:29,996 INFO L175 Difference]: Start difference. First operand has 59 places, 36 transitions, 133 flow. Second operand 7 states and 160 transitions. [2024-11-10 18:01:29,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 102 transitions, 518 flow [2024-11-10 18:01:30,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 102 transitions, 480 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 18:01:30,066 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 129 flow [2024-11-10 18:01:30,066 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=7, PETRI_FLOW=129, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2024-11-10 18:01:30,067 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -32 predicate places. [2024-11-10 18:01:30,067 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 129 flow [2024-11-10 18:01:30,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-10 18:01:30,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:30,067 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-11-10 18:01:30,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 18:01:30,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:30,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:30,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1991001302, now seen corresponding path program 1 times [2024-11-10 18:01:30,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:30,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457535177] [2024-11-10 18:01:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:30,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:30,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:30,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:30,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457535177] [2024-11-10 18:01:30,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457535177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:30,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:30,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:01:30,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872946391] [2024-11-10 18:01:30,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:30,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:01:30,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:30,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:01:30,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:01:30,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:30,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 129 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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-11-10 18:01:30,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:30,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:30,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:31,577 INFO L124 PetriNetUnfolderBase]: 8061/11893 cut-off events. [2024-11-10 18:01:31,580 INFO L125 PetriNetUnfolderBase]: For 2674/2674 co-relation queries the response was YES. [2024-11-10 18:01:31,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28452 conditions, 11893 events. 8061/11893 cut-off events. For 2674/2674 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 67760 event pairs, 1287 based on Foata normal form. 225/11747 useless extension candidates. Maximal degree in co-relation 28435. Up to 4793 conditions per place. [2024-11-10 18:01:31,659 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 47 selfloop transitions, 3 changer transitions 53/108 dead transitions. [2024-11-10 18:01:31,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 108 transitions, 510 flow [2024-11-10 18:01:31,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 18:01:31,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 18:01:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 176 transitions. [2024-11-10 18:01:31,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.19642857142857142 [2024-11-10 18:01:31,661 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 129 flow. Second operand 8 states and 176 transitions. [2024-11-10 18:01:31,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 108 transitions, 510 flow [2024-11-10 18:01:31,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 108 transitions, 488 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-11-10 18:01:31,724 INFO L231 Difference]: Finished difference. Result has 61 places, 36 transitions, 139 flow [2024-11-10 18:01:31,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=139, PETRI_PLACES=61, PETRI_TRANSITIONS=36} [2024-11-10 18:01:31,725 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -29 predicate places. [2024-11-10 18:01:31,725 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 36 transitions, 139 flow [2024-11-10 18:01:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 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-11-10 18:01:31,725 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:31,725 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-11-10 18:01:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 18:01:31,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1965092136, now seen corresponding path program 1 times [2024-11-10 18:01:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038216888] [2024-11-10 18:01:31,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:31,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:31,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:32,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:32,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:32,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038216888] [2024-11-10 18:01:32,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038216888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:32,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:32,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:01:32,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050848309] [2024-11-10 18:01:32,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:32,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:01:32,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:32,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:01:32,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:01:32,338 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:32,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 36 transitions, 139 flow. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-11-10 18:01:32,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:32,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:32,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:33,441 INFO L124 PetriNetUnfolderBase]: 4171/6447 cut-off events. [2024-11-10 18:01:33,441 INFO L125 PetriNetUnfolderBase]: For 3003/3003 co-relation queries the response was YES. [2024-11-10 18:01:33,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15428 conditions, 6447 events. 4171/6447 cut-off events. For 3003/3003 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 35842 event pairs, 2667 based on Foata normal form. 100/6485 useless extension candidates. Maximal degree in co-relation 15409. Up to 5444 conditions per place. [2024-11-10 18:01:33,491 INFO L140 encePairwiseOnDemand]: 102/112 looper letters, 46 selfloop transitions, 10 changer transitions 39/100 dead transitions. [2024-11-10 18:01:33,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 100 transitions, 515 flow [2024-11-10 18:01:33,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:01:33,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:01:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 197 transitions. [2024-11-10 18:01:33,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.1599025974025974 [2024-11-10 18:01:33,493 INFO L175 Difference]: Start difference. First operand has 61 places, 36 transitions, 139 flow. Second operand 11 states and 197 transitions. [2024-11-10 18:01:33,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 100 transitions, 515 flow [2024-11-10 18:01:33,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 453 flow, removed 19 selfloop flow, removed 9 redundant places. [2024-11-10 18:01:33,530 INFO L231 Difference]: Finished difference. Result has 66 places, 44 transitions, 190 flow [2024-11-10 18:01:33,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=111, 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=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=190, PETRI_PLACES=66, PETRI_TRANSITIONS=44} [2024-11-10 18:01:33,531 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -24 predicate places. [2024-11-10 18:01:33,531 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 44 transitions, 190 flow [2024-11-10 18:01:33,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 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-11-10 18:01:33,531 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:33,531 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] [2024-11-10 18:01:33,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 18:01:33,531 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:33,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:33,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1638766241, now seen corresponding path program 1 times [2024-11-10 18:01:33,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:33,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917985312] [2024-11-10 18:01:33,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:33,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:33,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:35,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:35,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:35,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917985312] [2024-11-10 18:01:35,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917985312] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:35,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:35,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 18:01:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463645214] [2024-11-10 18:01:35,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:35,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 18:01:35,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:35,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 18:01:35,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 18:01:35,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:35,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 44 transitions, 190 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-10 18:01:35,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:35,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:35,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:36,341 INFO L124 PetriNetUnfolderBase]: 4344/6649 cut-off events. [2024-11-10 18:01:36,342 INFO L125 PetriNetUnfolderBase]: For 6805/6805 co-relation queries the response was YES. [2024-11-10 18:01:36,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18498 conditions, 6649 events. 4344/6649 cut-off events. For 6805/6805 co-relation queries the response was YES. Maximal size of possible extension queue 225. Compared 35744 event pairs, 2509 based on Foata normal form. 107/6694 useless extension candidates. Maximal degree in co-relation 18478. Up to 5027 conditions per place. [2024-11-10 18:01:36,378 INFO L140 encePairwiseOnDemand]: 102/112 looper letters, 59 selfloop transitions, 13 changer transitions 57/134 dead transitions. [2024-11-10 18:01:36,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 134 transitions, 742 flow [2024-11-10 18:01:36,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:01:36,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:01:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 224 transitions. [2024-11-10 18:01:36,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.18181818181818182 [2024-11-10 18:01:36,380 INFO L175 Difference]: Start difference. First operand has 66 places, 44 transitions, 190 flow. Second operand 11 states and 224 transitions. [2024-11-10 18:01:36,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 134 transitions, 742 flow [2024-11-10 18:01:36,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 134 transitions, 720 flow, removed 11 selfloop flow, removed 4 redundant places. [2024-11-10 18:01:36,414 INFO L231 Difference]: Finished difference. Result has 74 places, 48 transitions, 275 flow [2024-11-10 18:01:36,414 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=275, PETRI_PLACES=74, PETRI_TRANSITIONS=48} [2024-11-10 18:01:36,415 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -16 predicate places. [2024-11-10 18:01:36,416 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 48 transitions, 275 flow [2024-11-10 18:01:36,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 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-11-10 18:01:36,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:36,416 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] [2024-11-10 18:01:36,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 18:01:36,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:36,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:36,417 INFO L85 PathProgramCache]: Analyzing trace with hash 763652466, now seen corresponding path program 1 times [2024-11-10 18:01:36,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:36,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564978770] [2024-11-10 18:01:36,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:36,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:36,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:36,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:36,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564978770] [2024-11-10 18:01:36,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564978770] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:36,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:36,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:01:36,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155320290] [2024-11-10 18:01:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:36,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:36,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:36,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:36,504 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:36,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 48 transitions, 275 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-11-10 18:01:36,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:36,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:36,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:37,080 INFO L124 PetriNetUnfolderBase]: 3656/5649 cut-off events. [2024-11-10 18:01:37,080 INFO L125 PetriNetUnfolderBase]: For 14498/14498 co-relation queries the response was YES. [2024-11-10 18:01:37,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19520 conditions, 5649 events. 3656/5649 cut-off events. For 14498/14498 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 29818 event pairs, 2897 based on Foata normal form. 0/5588 useless extension candidates. Maximal degree in co-relation 19494. Up to 4969 conditions per place. [2024-11-10 18:01:37,118 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 44 selfloop transitions, 16 changer transitions 0/65 dead transitions. [2024-11-10 18:01:37,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 462 flow [2024-11-10 18:01:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:37,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2024-11-10 18:01:37,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23809523809523808 [2024-11-10 18:01:37,120 INFO L175 Difference]: Start difference. First operand has 74 places, 48 transitions, 275 flow. Second operand 3 states and 80 transitions. [2024-11-10 18:01:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 462 flow [2024-11-10 18:01:37,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 65 transitions, 416 flow, removed 12 selfloop flow, removed 8 redundant places. [2024-11-10 18:01:37,164 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 327 flow [2024-11-10 18:01:37,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=327, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2024-11-10 18:01:37,165 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -27 predicate places. [2024-11-10 18:01:37,165 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 327 flow [2024-11-10 18:01:37,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-11-10 18:01:37,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:37,166 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] [2024-11-10 18:01:37,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 18:01:37,166 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:37,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:37,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1445596585, now seen corresponding path program 1 times [2024-11-10 18:01:37,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:37,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107071874] [2024-11-10 18:01:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:37,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:37,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:37,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107071874] [2024-11-10 18:01:37,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107071874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:37,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:37,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:01:37,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782624125] [2024-11-10 18:01:37,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:37,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:01:37,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:37,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:01:37,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:01:37,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:37,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-11-10 18:01:37,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:37,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:37,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:37,749 INFO L124 PetriNetUnfolderBase]: 3635/5628 cut-off events. [2024-11-10 18:01:37,749 INFO L125 PetriNetUnfolderBase]: For 12665/12665 co-relation queries the response was YES. [2024-11-10 18:01:37,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18584 conditions, 5628 events. 3635/5628 cut-off events. For 12665/12665 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 29984 event pairs, 3122 based on Foata normal form. 0/5588 useless extension candidates. Maximal degree in co-relation 18564. Up to 5304 conditions per place. [2024-11-10 18:01:37,780 INFO L140 encePairwiseOnDemand]: 110/112 looper letters, 45 selfloop transitions, 1 changer transitions 0/51 dead transitions. [2024-11-10 18:01:37,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 51 transitions, 402 flow [2024-11-10 18:01:37,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:01:37,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:01:37,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2024-11-10 18:01:37,782 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.17857142857142858 [2024-11-10 18:01:37,782 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 327 flow. Second operand 3 states and 60 transitions. [2024-11-10 18:01:37,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 51 transitions, 402 flow [2024-11-10 18:01:37,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 51 transitions, 367 flow, removed 10 selfloop flow, removed 3 redundant places. [2024-11-10 18:01:37,809 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 277 flow [2024-11-10 18:01:37,810 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=277, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2024-11-10 18:01:37,810 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -28 predicate places. [2024-11-10 18:01:37,810 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 277 flow [2024-11-10 18:01:37,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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-11-10 18:01:37,810 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:37,811 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] [2024-11-10 18:01:37,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 18:01:37,811 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:37,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:37,811 INFO L85 PathProgramCache]: Analyzing trace with hash 130484388, now seen corresponding path program 1 times [2024-11-10 18:01:37,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:37,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912966071] [2024-11-10 18:01:37,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:37,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:37,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:37,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:37,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912966071] [2024-11-10 18:01:37,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912966071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:37,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:37,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:01:37,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590458241] [2024-11-10 18:01:37,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:37,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:01:37,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:37,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:01:37,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:01:37,969 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:37,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-10 18:01:37,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:37,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:37,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:38,483 INFO L124 PetriNetUnfolderBase]: 3221/5084 cut-off events. [2024-11-10 18:01:38,483 INFO L125 PetriNetUnfolderBase]: For 8033/8033 co-relation queries the response was YES. [2024-11-10 18:01:38,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15355 conditions, 5084 events. 3221/5084 cut-off events. For 8033/8033 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 28571 event pairs, 317 based on Foata normal form. 230/5278 useless extension candidates. Maximal degree in co-relation 15336. Up to 2911 conditions per place. [2024-11-10 18:01:38,508 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 77 selfloop transitions, 5 changer transitions 1/88 dead transitions. [2024-11-10 18:01:38,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 88 transitions, 650 flow [2024-11-10 18:01:38,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:01:38,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:01:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 104 transitions. [2024-11-10 18:01:38,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.23214285714285715 [2024-11-10 18:01:38,510 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 277 flow. Second operand 4 states and 104 transitions. [2024-11-10 18:01:38,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 88 transitions, 650 flow [2024-11-10 18:01:38,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 88 transitions, 649 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:01:38,514 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 295 flow [2024-11-10 18:01:38,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-11-10 18:01:38,515 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -24 predicate places. [2024-11-10 18:01:38,515 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 295 flow [2024-11-10 18:01:38,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 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-11-10 18:01:38,515 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:38,515 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-11-10 18:01:38,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 18:01:38,516 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:38,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:38,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1965875997, now seen corresponding path program 1 times [2024-11-10 18:01:38,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:38,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496502161] [2024-11-10 18:01:38,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:38,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:38,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:38,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:38,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496502161] [2024-11-10 18:01:38,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496502161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:38,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:38,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:01:38,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192496938] [2024-11-10 18:01:38,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:38,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:01:38,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:38,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:01:38,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:01:38,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:38,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-10 18:01:38,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:38,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:38,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:39,530 INFO L124 PetriNetUnfolderBase]: 3864/6115 cut-off events. [2024-11-10 18:01:39,530 INFO L125 PetriNetUnfolderBase]: For 10036/10036 co-relation queries the response was YES. [2024-11-10 18:01:39,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19984 conditions, 6115 events. 3864/6115 cut-off events. For 10036/10036 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 34405 event pairs, 2996 based on Foata normal form. 0/6110 useless extension candidates. Maximal degree in co-relation 19962. Up to 3440 conditions per place. [2024-11-10 18:01:39,565 INFO L140 encePairwiseOnDemand]: 104/112 looper letters, 66 selfloop transitions, 14 changer transitions 0/85 dead transitions. [2024-11-10 18:01:39,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 591 flow [2024-11-10 18:01:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:01:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:01:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 105 transitions. [2024-11-10 18:01:39,567 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.234375 [2024-11-10 18:01:39,567 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 295 flow. Second operand 4 states and 105 transitions. [2024-11-10 18:01:39,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 591 flow [2024-11-10 18:01:39,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 85 transitions, 570 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 18:01:39,571 INFO L231 Difference]: Finished difference. Result has 67 places, 50 transitions, 299 flow [2024-11-10 18:01:39,572 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=67, PETRI_TRANSITIONS=50} [2024-11-10 18:01:39,572 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -23 predicate places. [2024-11-10 18:01:39,572 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 50 transitions, 299 flow [2024-11-10 18:01:39,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-10 18:01:39,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:39,572 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-11-10 18:01:39,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 18:01:39,573 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:39,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:39,573 INFO L85 PathProgramCache]: Analyzing trace with hash 937797335, now seen corresponding path program 1 times [2024-11-10 18:01:39,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:39,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438876084] [2024-11-10 18:01:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:39,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:39,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438876084] [2024-11-10 18:01:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438876084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:39,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:01:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073821206] [2024-11-10 18:01:39,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:39,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:01:39,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:39,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:01:39,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:01:39,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:39,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 50 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-11-10 18:01:39,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:39,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:39,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:40,388 INFO L124 PetriNetUnfolderBase]: 2778/4513 cut-off events. [2024-11-10 18:01:40,388 INFO L125 PetriNetUnfolderBase]: For 7609/7609 co-relation queries the response was YES. [2024-11-10 18:01:40,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13876 conditions, 4513 events. 2778/4513 cut-off events. For 7609/7609 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 25164 event pairs, 216 based on Foata normal form. 248/4756 useless extension candidates. Maximal degree in co-relation 13854. Up to 1909 conditions per place. [2024-11-10 18:01:40,407 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 78 selfloop transitions, 8 changer transitions 1/92 dead transitions. [2024-11-10 18:01:40,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 92 transitions, 729 flow [2024-11-10 18:01:40,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:01:40,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:01:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2024-11-10 18:01:40,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21607142857142858 [2024-11-10 18:01:40,409 INFO L175 Difference]: Start difference. First operand has 67 places, 50 transitions, 299 flow. Second operand 5 states and 121 transitions. [2024-11-10 18:01:40,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 92 transitions, 729 flow [2024-11-10 18:01:40,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 92 transitions, 685 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:01:40,413 INFO L231 Difference]: Finished difference. Result has 70 places, 53 transitions, 319 flow [2024-11-10 18:01:40,413 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=319, PETRI_PLACES=70, PETRI_TRANSITIONS=53} [2024-11-10 18:01:40,414 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -20 predicate places. [2024-11-10 18:01:40,414 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 53 transitions, 319 flow [2024-11-10 18:01:40,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 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-11-10 18:01:40,415 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:40,417 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] [2024-11-10 18:01:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 18:01:40,418 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:40,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash 891980300, now seen corresponding path program 1 times [2024-11-10 18:01:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641463864] [2024-11-10 18:01:40,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:40,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:40,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:40,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641463864] [2024-11-10 18:01:40,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641463864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:40,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:40,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:01:40,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134803541] [2024-11-10 18:01:40,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:40,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:01:40,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:40,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:01:40,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:01:40,708 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:01:40,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 53 transitions, 319 flow. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-10 18:01:40,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:40,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:01:40,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:41,072 INFO L124 PetriNetUnfolderBase]: 1139/1828 cut-off events. [2024-11-10 18:01:41,072 INFO L125 PetriNetUnfolderBase]: For 4382/4382 co-relation queries the response was YES. [2024-11-10 18:01:41,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6398 conditions, 1828 events. 1139/1828 cut-off events. For 4382/4382 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8238 event pairs, 131 based on Foata normal form. 84/1907 useless extension candidates. Maximal degree in co-relation 6374. Up to 608 conditions per place. [2024-11-10 18:01:41,081 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 68 selfloop transitions, 11 changer transitions 1/85 dead transitions. [2024-11-10 18:01:41,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 85 transitions, 643 flow [2024-11-10 18:01:41,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:01:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:01:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 126 transitions. [2024-11-10 18:01:41,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.1875 [2024-11-10 18:01:41,082 INFO L175 Difference]: Start difference. First operand has 70 places, 53 transitions, 319 flow. Second operand 6 states and 126 transitions. [2024-11-10 18:01:41,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 85 transitions, 643 flow [2024-11-10 18:01:41,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 85 transitions, 595 flow, removed 11 selfloop flow, removed 6 redundant places. [2024-11-10 18:01:41,088 INFO L231 Difference]: Finished difference. Result has 71 places, 52 transitions, 306 flow [2024-11-10 18:01:41,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=71, PETRI_TRANSITIONS=52} [2024-11-10 18:01:41,088 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -19 predicate places. [2024-11-10 18:01:41,088 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 52 transitions, 306 flow [2024-11-10 18:01:41,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 6 states have internal predecessors, (81), 0 states have call successors, (0), 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-11-10 18:01:41,089 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:41,089 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-11-10 18:01:41,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 18:01:41,089 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:41,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:41,089 INFO L85 PathProgramCache]: Analyzing trace with hash -211038862, now seen corresponding path program 1 times [2024-11-10 18:01:41,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:41,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914862795] [2024-11-10 18:01:41,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:41,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:43,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:43,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:43,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914862795] [2024-11-10 18:01:43,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914862795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:43,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:43,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:01:43,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013978929] [2024-11-10 18:01:43,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:01:43,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:43,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:01:43,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:01:43,230 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:43,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 52 transitions, 306 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:43,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:43,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:43,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:43,936 INFO L124 PetriNetUnfolderBase]: 1362/2152 cut-off events. [2024-11-10 18:01:43,936 INFO L125 PetriNetUnfolderBase]: For 5285/5285 co-relation queries the response was YES. [2024-11-10 18:01:43,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7570 conditions, 2152 events. 1362/2152 cut-off events. For 5285/5285 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 9803 event pairs, 425 based on Foata normal form. 8/2158 useless extension candidates. Maximal degree in co-relation 7547. Up to 811 conditions per place. [2024-11-10 18:01:43,946 INFO L140 encePairwiseOnDemand]: 100/112 looper letters, 75 selfloop transitions, 15 changer transitions 41/136 dead transitions. [2024-11-10 18:01:43,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 136 transitions, 1024 flow [2024-11-10 18:01:43,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:01:43,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:01:43,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 182 transitions. [2024-11-10 18:01:43,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.18055555555555555 [2024-11-10 18:01:43,947 INFO L175 Difference]: Start difference. First operand has 71 places, 52 transitions, 306 flow. Second operand 9 states and 182 transitions. [2024-11-10 18:01:43,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 136 transitions, 1024 flow [2024-11-10 18:01:43,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 136 transitions, 770 flow, removed 52 selfloop flow, removed 10 redundant places. [2024-11-10 18:01:43,957 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 295 flow [2024-11-10 18:01:43,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2024-11-10 18:01:43,957 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -16 predicate places. [2024-11-10 18:01:43,957 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 295 flow [2024-11-10 18:01:43,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:43,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:43,958 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-11-10 18:01:43,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 18:01:43,958 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:43,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:43,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1507868246, now seen corresponding path program 1 times [2024-11-10 18:01:43,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:43,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6314884] [2024-11-10 18:01:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:43,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:43,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:46,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:46,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:46,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6314884] [2024-11-10 18:01:46,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6314884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:46,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:46,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:01:46,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378477947] [2024-11-10 18:01:46,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:46,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:01:46,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:46,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:01:46,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:01:46,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:46,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 295 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:46,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:46,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:46,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:47,054 INFO L124 PetriNetUnfolderBase]: 1816/2893 cut-off events. [2024-11-10 18:01:47,055 INFO L125 PetriNetUnfolderBase]: For 3243/3243 co-relation queries the response was YES. [2024-11-10 18:01:47,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8386 conditions, 2893 events. 1816/2893 cut-off events. For 3243/3243 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 14299 event pairs, 501 based on Foata normal form. 8/2898 useless extension candidates. Maximal degree in co-relation 8364. Up to 1273 conditions per place. [2024-11-10 18:01:47,070 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 100 selfloop transitions, 14 changer transitions 18/137 dead transitions. [2024-11-10 18:01:47,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 137 transitions, 890 flow [2024-11-10 18:01:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 18:01:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 18:01:47,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 177 transitions. [2024-11-10 18:01:47,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.17559523809523808 [2024-11-10 18:01:47,072 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 295 flow. Second operand 9 states and 177 transitions. [2024-11-10 18:01:47,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 137 transitions, 890 flow [2024-11-10 18:01:47,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 137 transitions, 813 flow, removed 25 selfloop flow, removed 8 redundant places. [2024-11-10 18:01:47,078 INFO L231 Difference]: Finished difference. Result has 75 places, 59 transitions, 349 flow [2024-11-10 18:01:47,078 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=349, PETRI_PLACES=75, PETRI_TRANSITIONS=59} [2024-11-10 18:01:47,079 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -15 predicate places. [2024-11-10 18:01:47,079 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 59 transitions, 349 flow [2024-11-10 18:01:47,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:47,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:47,080 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-11-10 18:01:47,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 18:01:47,080 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:47,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:47,081 INFO L85 PathProgramCache]: Analyzing trace with hash -206812692, now seen corresponding path program 2 times [2024-11-10 18:01:47,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:47,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591254527] [2024-11-10 18:01:47,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:47,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:49,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-11-10 18:01:49,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:49,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591254527] [2024-11-10 18:01:49,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591254527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:49,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:49,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:01:49,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161981514] [2024-11-10 18:01:49,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:49,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:01:49,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:49,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:01:49,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:01:49,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:49,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 59 transitions, 349 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:49,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:49,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:49,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:50,206 INFO L124 PetriNetUnfolderBase]: 2040/3276 cut-off events. [2024-11-10 18:01:50,206 INFO L125 PetriNetUnfolderBase]: For 4164/4164 co-relation queries the response was YES. [2024-11-10 18:01:50,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9251 conditions, 3276 events. 2040/3276 cut-off events. For 4164/4164 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 16675 event pairs, 644 based on Foata normal form. 8/3282 useless extension candidates. Maximal degree in co-relation 9229. Up to 1246 conditions per place. [2024-11-10 18:01:50,222 INFO L140 encePairwiseOnDemand]: 102/112 looper letters, 79 selfloop transitions, 15 changer transitions 38/137 dead transitions. [2024-11-10 18:01:50,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 137 transitions, 911 flow [2024-11-10 18:01:50,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 18:01:50,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 18:01:50,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 201 transitions. [2024-11-10 18:01:50,224 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.16314935064935066 [2024-11-10 18:01:50,224 INFO L175 Difference]: Start difference. First operand has 75 places, 59 transitions, 349 flow. Second operand 11 states and 201 transitions. [2024-11-10 18:01:50,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 137 transitions, 911 flow [2024-11-10 18:01:50,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 137 transitions, 867 flow, removed 16 selfloop flow, removed 4 redundant places. [2024-11-10 18:01:50,229 INFO L231 Difference]: Finished difference. Result has 82 places, 57 transitions, 345 flow [2024-11-10 18:01:50,229 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=345, PETRI_PLACES=82, PETRI_TRANSITIONS=57} [2024-11-10 18:01:50,230 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -8 predicate places. [2024-11-10 18:01:50,230 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 57 transitions, 345 flow [2024-11-10 18:01:50,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:50,230 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:50,230 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-11-10 18:01:50,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 18:01:50,231 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:50,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:50,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1428158802, now seen corresponding path program 3 times [2024-11-10 18:01:50,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:50,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927653844] [2024-11-10 18:01:50,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:50,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:50,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:01:52,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:01:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 18:01:52,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927653844] [2024-11-10 18:01:52,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927653844] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:01:52,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:01:52,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 18:01:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727570947] [2024-11-10 18:01:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:01:52,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 18:01:52,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 18:01:52,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 18:01:52,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-10 18:01:52,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:01:52,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 57 transitions, 345 flow. Second operand has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:52,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:01:52,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:01:52,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:01:53,020 INFO L124 PetriNetUnfolderBase]: 2171/3493 cut-off events. [2024-11-10 18:01:53,020 INFO L125 PetriNetUnfolderBase]: For 5048/5048 co-relation queries the response was YES. [2024-11-10 18:01:53,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 3493 events. 2171/3493 cut-off events. For 5048/5048 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 18225 event pairs, 684 based on Foata normal form. 16/3507 useless extension candidates. Maximal degree in co-relation 9753. Up to 1607 conditions per place. [2024-11-10 18:01:53,035 INFO L140 encePairwiseOnDemand]: 101/112 looper letters, 113 selfloop transitions, 16 changer transitions 24/158 dead transitions. [2024-11-10 18:01:53,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 158 transitions, 1034 flow [2024-11-10 18:01:53,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 18:01:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-10 18:01:53,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 230 transitions. [2024-11-10 18:01:53,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.15796703296703296 [2024-11-10 18:01:53,037 INFO L175 Difference]: Start difference. First operand has 82 places, 57 transitions, 345 flow. Second operand 13 states and 230 transitions. [2024-11-10 18:01:53,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 158 transitions, 1034 flow [2024-11-10 18:01:53,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 158 transitions, 975 flow, removed 22 selfloop flow, removed 8 redundant places. [2024-11-10 18:01:53,044 INFO L231 Difference]: Finished difference. Result has 87 places, 63 transitions, 416 flow [2024-11-10 18:01:53,044 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=416, PETRI_PLACES=87, PETRI_TRANSITIONS=63} [2024-11-10 18:01:53,044 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2024-11-10 18:01:53,044 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 63 transitions, 416 flow [2024-11-10 18:01:53,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.181818181818182) internal successors, (123), 11 states have internal predecessors, (123), 0 states have call successors, (0), 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-11-10 18:01:53,045 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:01:53,045 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-11-10 18:01:53,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 18:01:53,045 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:01:53,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:01:53,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1407089872, now seen corresponding path program 4 times [2024-11-10 18:01:53,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 18:01:53,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319212130] [2024-11-10 18:01:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:01:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 18:01:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:01:53,105 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 18:01:53,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 18:01:53,195 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 18:01:53,196 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 18:01:53,196 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2024-11-10 18:01:53,198 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2024-11-10 18:01:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2024-11-10 18:01:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2024-11-10 18:01:53,199 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (71 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2024-11-10 18:01:53,200 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2024-11-10 18:01:53,201 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (40 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2024-11-10 18:01:53,202 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2024-11-10 18:01:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2024-11-10 18:01:53,203 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2024-11-10 18:01:53,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2024-11-10 18:01:53,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4ASSERT_VIOLATIONMEMORY_LEAK (24 of 85 remaining) [2024-11-10 18:01:53,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2024-11-10 18:01:53,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2024-11-10 18:01:53,204 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2024-11-10 18:01:53,205 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2024-11-10 18:01:53,206 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2024-11-10 18:01:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 18:01:53,207 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:01:53,289 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 18:01:53,289 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 18:01:53,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:01:53 BasicIcfg [2024-11-10 18:01:53,294 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 18:01:53,295 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 18:01:53,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 18:01:53,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 18:01:53,296 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:01:08" (3/4) ... [2024-11-10 18:01:53,298 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 18:01:53,298 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 18:01:53,299 INFO L158 Benchmark]: Toolchain (without parser) took 46980.61ms. Allocated memory was 205.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 135.3MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-10 18:01:53,299 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:01:53,300 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.96ms. Allocated memory is still 205.5MB. Free memory was 135.1MB in the beginning and 166.8MB in the end (delta: -31.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-11-10 18:01:53,300 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.99ms. Allocated memory is still 205.5MB. Free memory was 166.8MB in the beginning and 163.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 18:01:53,300 INFO L158 Benchmark]: Boogie Preprocessor took 69.69ms. Allocated memory is still 205.5MB. Free memory was 163.9MB in the beginning and 159.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 18:01:53,300 INFO L158 Benchmark]: IcfgBuilder took 1527.25ms. Allocated memory is still 205.5MB. Free memory was 159.3MB in the beginning and 136.1MB in the end (delta: 23.2MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. [2024-11-10 18:01:53,300 INFO L158 Benchmark]: TraceAbstraction took 44717.13ms. Allocated memory was 205.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 136.1MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2024-11-10 18:01:53,301 INFO L158 Benchmark]: Witness Printer took 3.09ms. Allocated memory is still 6.6GB. Free memory is still 5.4GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 18:01:53,301 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.09ms. Allocated memory is still 109.1MB. Free memory is still 79.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.96ms. Allocated memory is still 205.5MB. Free memory was 135.1MB in the beginning and 166.8MB in the end (delta: -31.7MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.99ms. Allocated memory is still 205.5MB. Free memory was 166.8MB in the beginning and 163.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.69ms. Allocated memory is still 205.5MB. Free memory was 163.9MB in the beginning and 159.3MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 1527.25ms. Allocated memory is still 205.5MB. Free memory was 159.3MB in the beginning and 136.1MB in the end (delta: 23.2MB). Peak memory consumption was 94.5MB. Max. memory is 16.1GB. * TraceAbstraction took 44717.13ms. Allocated memory was 205.5MB in the beginning and 6.6GB in the end (delta: 6.4GB). Free memory was 136.1MB in the beginning and 5.4GB in the end (delta: -5.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 3.09ms. Allocated memory is still 6.6GB. Free memory is still 5.4GB. 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; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L859] 0 pthread_t t2204; [L860] FCALL, FORK 0 pthread_create(&t2204, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-2, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L861] 0 pthread_t t2205; [L862] FCALL, FORK 0 pthread_create(&t2205, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-2, t2205=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2206; [L864] FCALL, FORK 0 pthread_create(&t2206, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L789] 2 x$w_buff1 = x$w_buff0 [L790] 2 x$w_buff0 = 1 [L791] 2 x$w_buff1_used = x$w_buff0_used [L792] 2 x$w_buff0_used = (_Bool)1 [L793] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L793] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L794] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L795] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L796] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L797] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L798] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L815] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L816] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L817] 3 x$flush_delayed = weak$$choice2 [L818] EXPR 3 \read(x) [L818] 3 x$mem_tmp = x [L819] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 weak$$choice0 ? x$w_buff0 : x [L820] EXPR 3 x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x) [L820] EXPR 3 x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)) [L820] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x))) [L820] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L820] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L821] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L822] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L823] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L824] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L825] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L826] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L827] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L828] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L829] EXPR 3 \read(x) [L829] 3 __unbuffered_p2_EAX = x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L830] 3 x = x$flush_delayed ? x$mem_tmp : x [L831] 3 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L834] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 \read(x) [L837] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L837] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L837] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L838] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L839] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L840] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L841] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L761] 1 __unbuffered_p0_EAX = y VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L844] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L801] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L802] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L803] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L804] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L805] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L808] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 \read(x) [L870] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L870] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L870] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L871] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L872] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L873] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L874] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L877] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L878] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L878] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L878] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L879] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2204=-2, t2205=-1, t2206=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L881] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L18] 0 __assert_fail ("0", "safe018_power.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] - 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 862]: 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: 864]: 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: 860]: 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, 144 locations, 85 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: 44.4s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 30.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1207 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1202 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3899 IncrementalHoareTripleChecker+Invalid, 4082 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 2 mSDtfsCounter, 3899 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=416occurred in iteration=22, InterpolantAutomatonStates: 135, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 13.0s InterpolantComputationTime, 445 NumberOfCodeBlocks, 445 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 394 ConstructedInterpolants, 0 QuantifiedInterpolants, 4610 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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-11-10 18:01:53,338 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-wmm/safe018_power.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 18:01:56,269 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 18:01:56,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 18:01:56,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 18:01:56,335 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 18:01:56,362 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 18:01:56,363 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 18:01:56,363 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 18:01:56,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 18:01:56,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 18:01:56,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 18:01:56,364 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 18:01:56,364 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 18:01:56,365 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 18:01:56,365 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 18:01:56,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 18:01:56,365 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 18:01:56,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 18:01:56,366 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 18:01:56,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 18:01:56,369 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 18:01:56,370 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 18:01:56,371 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 18:01:56,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 18:01:56,371 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 18:01:56,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 18:01:56,372 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 18:01:56,372 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 18:01:56,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 18:01:56,372 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 18:01:56,372 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 18:01:56,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 18:01:56,373 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 18:01:56,373 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 18:01:56,373 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 18:01:56,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:01:56,373 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 18:01:56,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 18:01:56,374 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 18:01:56,374 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 18:01:56,374 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 18:01:56,377 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 18:01:56,377 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 18:01:56,378 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 18:01:56,378 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/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 81ed16bb51b8da596bb3c9a2024b72d3baf359b31125524126025207d822fe2c [2024-11-10 18:01:56,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 18:01:56,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 18:01:56,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 18:01:56,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 18:01:56,643 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 18:01:56,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe018_power.opt.i [2024-11-10 18:01:58,003 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 18:01:58,205 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 18:01:58,205 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe018_power.opt.i [2024-11-10 18:01:58,220 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980850fe0/c45e0898c7e741aa9ec114ab51ef3695/FLAG71040641d [2024-11-10 18:01:58,232 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/980850fe0/c45e0898c7e741aa9ec114ab51ef3695 [2024-11-10 18:01:58,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 18:01:58,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 18:01:58,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 18:01:58,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 18:01:58,242 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 18:01:58,243 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a1bb6bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58, skipping insertion in model container [2024-11-10 18:01:58,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 18:01:58,662 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:01:58,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 18:01:58,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 18:01:58,771 INFO L204 MainTranslator]: Completed translation [2024-11-10 18:01:58,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58 WrapperNode [2024-11-10 18:01:58,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 18:01:58,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 18:01:58,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 18:01:58,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 18:01:58,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,840 INFO L138 Inliner]: procedures = 179, calls = 64, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2024-11-10 18:01:58,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 18:01:58,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 18:01:58,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 18:01:58,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 18:01:58,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,856 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,877 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 7 writes are split as follows [0, 7]. [2024-11-10 18:01:58,880 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,880 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,887 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,893 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 18:01:58,894 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 18:01:58,894 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 18:01:58,894 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 18:01:58,894 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (1/1) ... [2024-11-10 18:01:58,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 18:01:58,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 18:01:58,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 18:01:58,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 18:01:58,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 18:01:58,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-11-10 18:01:58,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-11-10 18:01:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-11-10 18:01:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-11-10 18:01:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-11-10 18:01:58,962 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-11-10 18:01:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-10 18:01:58,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 18:01:58,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 18:01:58,964 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 18:01:59,104 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 18:01:59,106 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 18:01:59,760 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 18:01:59,761 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 18:02:00,330 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-10 18:02:00,389 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-10 18:02:00,441 WARN L170 LargeBlockEncoding]: Complex 2:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2024-11-10 18:02:00,543 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 18:02:00,543 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 18:02:00,543 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:02:00 BoogieIcfgContainer [2024-11-10 18:02:00,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 18:02:00,548 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 18:02:00,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 18:02:00,552 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 18:02:00,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:01:58" (1/3) ... [2024-11-10 18:02:00,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c4e0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:02:00, skipping insertion in model container [2024-11-10 18:02:00,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:01:58" (2/3) ... [2024-11-10 18:02:00,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c4e0a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:02:00, skipping insertion in model container [2024-11-10 18:02:00,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 06:02:00" (3/3) ... [2024-11-10 18:02:00,554 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_power.opt.i [2024-11-10 18:02:00,575 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 18:02:00,575 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2024-11-10 18:02:00,575 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 18:02:00,866 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 18:02:00,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 112 transitions, 236 flow [2024-11-10 18:02:00,996 INFO L124 PetriNetUnfolderBase]: 29/109 cut-off events. [2024-11-10 18:02:00,997 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:02:01,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 29/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 366 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 111. Up to 4 conditions per place. [2024-11-10 18:02:01,006 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 112 transitions, 236 flow [2024-11-10 18:02:01,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 109 transitions, 227 flow [2024-11-10 18:02:01,025 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 18:02:01,033 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;@5ef1e08e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 18:02:01,033 INFO L334 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2024-11-10 18:02:01,041 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 18:02:01,041 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-10 18:02:01,041 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:02:01,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:01,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:02:01,043 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:01,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash 918914320, now seen corresponding path program 1 times [2024-11-10 18:02:01,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:01,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [386767059] [2024-11-10 18:02:01,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:01,064 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-11-10 18:02:01,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:01,066 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:01,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 18:02:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:01,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:02:01,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:01,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:01,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:01,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [386767059] [2024-11-10 18:02:01,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [386767059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:01,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:01,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:02:01,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902232375] [2024-11-10 18:02:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:01,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:02:01,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:01,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:02:01,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:02:01,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:01,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:02:01,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:01,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:01,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:06,589 INFO L124 PetriNetUnfolderBase]: 20549/29651 cut-off events. [2024-11-10 18:02:06,589 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2024-11-10 18:02:06,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57516 conditions, 29651 events. 20549/29651 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 1221. Compared 192780 event pairs, 18197 based on Foata normal form. 1008/20151 useless extension candidates. Maximal degree in co-relation 57505. Up to 27732 conditions per place. [2024-11-10 18:02:06,807 INFO L140 encePairwiseOnDemand]: 53/112 looper letters, 42 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2024-11-10 18:02:06,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 50 transitions, 195 flow [2024-11-10 18:02:06,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:02:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:02:06,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2024-11-10 18:02:06,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3898809523809524 [2024-11-10 18:02:06,818 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 227 flow. Second operand 3 states and 131 transitions. [2024-11-10 18:02:06,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 50 transitions, 195 flow [2024-11-10 18:02:06,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 50 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-10 18:02:06,823 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 108 flow [2024-11-10 18:02:06,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2024-11-10 18:02:06,827 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -34 predicate places. [2024-11-10 18:02:06,827 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 108 flow [2024-11-10 18:02:06,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:02:06,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:06,827 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 18:02:06,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 18:02:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:07,034 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:07,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 918914321, now seen corresponding path program 1 times [2024-11-10 18:02:07,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:07,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [260362471] [2024-11-10 18:02:07,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:07,036 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-11-10 18:02:07,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:07,043 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:07,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 18:02:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:07,186 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:02:07,187 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:07,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:07,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:07,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [260362471] [2024-11-10 18:02:07,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [260362471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:07,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:07,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:02:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345171295] [2024-11-10 18:02:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:07,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:02:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:02:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:02:07,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:07,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:02:07,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:07,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:07,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:09,610 INFO L124 PetriNetUnfolderBase]: 7691/11172 cut-off events. [2024-11-10 18:02:09,610 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:02:09,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21630 conditions, 11172 events. 7691/11172 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 431. Compared 63300 event pairs, 6395 based on Foata normal form. 0/8949 useless extension candidates. Maximal degree in co-relation 21624. Up to 10368 conditions per place. [2024-11-10 18:02:09,696 INFO L140 encePairwiseOnDemand]: 103/112 looper letters, 34 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2024-11-10 18:02:09,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 42 transitions, 162 flow [2024-11-10 18:02:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:02:09,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:02:09,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2024-11-10 18:02:09,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.21726190476190477 [2024-11-10 18:02:09,698 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 108 flow. Second operand 3 states and 73 transitions. [2024-11-10 18:02:09,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 42 transitions, 162 flow [2024-11-10 18:02:09,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 42 transitions, 161 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:02:09,699 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 93 flow [2024-11-10 18:02:09,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=91, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2024-11-10 18:02:09,700 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -41 predicate places. [2024-11-10 18:02:09,700 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 93 flow [2024-11-10 18:02:09,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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-11-10 18:02:09,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:09,701 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 18:02:09,706 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 18:02:09,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:09,903 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err4ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:09,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:09,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1578969622, now seen corresponding path program 1 times [2024-11-10 18:02:09,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:09,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1611936560] [2024-11-10 18:02:09,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:09,905 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-11-10 18:02:09,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:09,909 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:09,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 18:02:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:10,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:02:10,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:10,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:10,065 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:10,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1611936560] [2024-11-10 18:02:10,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1611936560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:10,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:10,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:02:10,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693509711] [2024-11-10 18:02:10,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:10,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:02:10,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:10,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:02:10,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:02:10,070 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:10,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 93 flow. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-10 18:02:10,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:10,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:10,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:12,013 INFO L124 PetriNetUnfolderBase]: 9433/13676 cut-off events. [2024-11-10 18:02:12,014 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 18:02:12,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26861 conditions, 13676 events. 9433/13676 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 81134 event pairs, 3225 based on Foata normal form. 0/12175 useless extension candidates. Maximal degree in co-relation 26854. Up to 6905 conditions per place. [2024-11-10 18:02:12,076 INFO L140 encePairwiseOnDemand]: 105/112 looper letters, 55 selfloop transitions, 3 changer transitions 2/67 dead transitions. [2024-11-10 18:02:12,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 67 transitions, 265 flow [2024-11-10 18:02:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:02:12,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:02:12,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-10 18:02:12,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.27976190476190477 [2024-11-10 18:02:12,078 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 93 flow. Second operand 3 states and 94 transitions. [2024-11-10 18:02:12,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 67 transitions, 265 flow [2024-11-10 18:02:12,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 264 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:02:12,080 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 110 flow [2024-11-10 18:02:12,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2024-11-10 18:02:12,080 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -39 predicate places. [2024-11-10 18:02:12,081 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 110 flow [2024-11-10 18:02:12,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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-11-10 18:02:12,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:12,081 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:02:12,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 18:02:12,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:12,282 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:12,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1078716433, now seen corresponding path program 1 times [2024-11-10 18:02:12,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:12,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630407696] [2024-11-10 18:02:12,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:12,285 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-11-10 18:02:12,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:12,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:12,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 18:02:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:12,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 18:02:12,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:12,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:12,413 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:12,413 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:12,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630407696] [2024-11-10 18:02:12,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630407696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:12,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:12,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 18:02:12,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56758545] [2024-11-10 18:02:12,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:12,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:02:12,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:12,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:02:12,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:02:12,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:12,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-11-10 18:02:12,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:12,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:12,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:13,841 INFO L124 PetriNetUnfolderBase]: 7045/10991 cut-off events. [2024-11-10 18:02:13,841 INFO L125 PetriNetUnfolderBase]: For 1794/1794 co-relation queries the response was YES. [2024-11-10 18:02:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22859 conditions, 10991 events. 7045/10991 cut-off events. For 1794/1794 co-relation queries the response was YES. Maximal size of possible extension queue 446. Compared 70524 event pairs, 615 based on Foata normal form. 300/10388 useless extension candidates. Maximal degree in co-relation 22849. Up to 7111 conditions per place. [2024-11-10 18:02:13,883 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 67 selfloop transitions, 5 changer transitions 1/80 dead transitions. [2024-11-10 18:02:13,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 80 transitions, 370 flow [2024-11-10 18:02:13,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:02:13,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:02:13,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 112 transitions. [2024-11-10 18:02:13,885 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.25 [2024-11-10 18:02:13,885 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 110 flow. Second operand 4 states and 112 transitions. [2024-11-10 18:02:13,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 80 transitions, 370 flow [2024-11-10 18:02:13,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 80 transitions, 356 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:02:13,888 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 138 flow [2024-11-10 18:02:13,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2024-11-10 18:02:13,889 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -37 predicate places. [2024-11-10 18:02:13,889 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 138 flow [2024-11-10 18:02:13,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 0 states have call successors, (0), 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-11-10 18:02:13,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:13,890 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 18:02:13,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 18:02:14,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:14,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:14,092 INFO L85 PathProgramCache]: Analyzing trace with hash -2141308210, now seen corresponding path program 1 times [2024-11-10 18:02:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:14,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752438443] [2024-11-10 18:02:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:14,092 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-11-10 18:02:14,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:14,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:14,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 18:02:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:14,216 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:02:14,217 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:14,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:14,252 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:14,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752438443] [2024-11-10 18:02:14,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752438443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:14,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:14,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 18:02:14,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407970422] [2024-11-10 18:02:14,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:14,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 18:02:14,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:14,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 18:02:14,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 18:02:14,254 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:14,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-10 18:02:14,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:14,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:14,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:15,031 INFO L124 PetriNetUnfolderBase]: 3643/5801 cut-off events. [2024-11-10 18:02:15,032 INFO L125 PetriNetUnfolderBase]: For 1335/1335 co-relation queries the response was YES. [2024-11-10 18:02:15,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13327 conditions, 5801 events. 3643/5801 cut-off events. For 1335/1335 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 33166 event pairs, 359 based on Foata normal form. 228/5526 useless extension candidates. Maximal degree in co-relation 13315. Up to 2629 conditions per place. [2024-11-10 18:02:15,054 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 83 selfloop transitions, 8 changer transitions 1/99 dead transitions. [2024-11-10 18:02:15,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 99 transitions, 485 flow [2024-11-10 18:02:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 18:02:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 18:02:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 142 transitions. [2024-11-10 18:02:15,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.25357142857142856 [2024-11-10 18:02:15,057 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 138 flow. Second operand 5 states and 142 transitions. [2024-11-10 18:02:15,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 99 transitions, 485 flow [2024-11-10 18:02:15,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 99 transitions, 475 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 18:02:15,061 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 178 flow [2024-11-10 18:02:15,061 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2024-11-10 18:02:15,061 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -33 predicate places. [2024-11-10 18:02:15,061 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 178 flow [2024-11-10 18:02:15,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 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-11-10 18:02:15,062 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:15,062 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-11-10 18:02:15,070 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 18:02:15,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:15,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:15,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:15,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1910586663, now seen corresponding path program 1 times [2024-11-10 18:02:15,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:15,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828820852] [2024-11-10 18:02:15,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:15,270 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-11-10 18:02:15,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:15,277 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:15,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-10 18:02:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:15,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 18:02:15,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:15,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:15,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828820852] [2024-11-10 18:02:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828820852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:02:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244783071] [2024-11-10 18:02:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:15,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:02:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:02:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:02:15,437 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:15,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-10 18:02:15,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:15,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:15,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:16,084 INFO L124 PetriNetUnfolderBase]: 1809/2795 cut-off events. [2024-11-10 18:02:16,084 INFO L125 PetriNetUnfolderBase]: For 1880/1880 co-relation queries the response was YES. [2024-11-10 18:02:16,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7243 conditions, 2795 events. 1809/2795 cut-off events. For 1880/1880 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 13083 event pairs, 309 based on Foata normal form. 96/2692 useless extension candidates. Maximal degree in co-relation 7229. Up to 920 conditions per place. [2024-11-10 18:02:16,095 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 70 selfloop transitions, 11 changer transitions 1/89 dead transitions. [2024-11-10 18:02:16,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 458 flow [2024-11-10 18:02:16,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:02:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:02:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-11-10 18:02:16,096 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2113095238095238 [2024-11-10 18:02:16,096 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 178 flow. Second operand 6 states and 142 transitions. [2024-11-10 18:02:16,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 458 flow [2024-11-10 18:02:16,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 89 transitions, 433 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-11-10 18:02:16,104 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 192 flow [2024-11-10 18:02:16,104 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2024-11-10 18:02:16,105 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -30 predicate places. [2024-11-10 18:02:16,105 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 192 flow [2024-11-10 18:02:16,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 6 states have internal predecessors, (78), 0 states have call successors, (0), 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-11-10 18:02:16,105 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:16,106 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-11-10 18:02:16,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-10 18:02:16,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:16,306 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash 597225101, now seen corresponding path program 1 times [2024-11-10 18:02:16,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:16,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189219356] [2024-11-10 18:02:16,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:16,307 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-11-10 18:02:16,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:16,308 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:16,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-10 18:02:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:16,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 18:02:16,475 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:16,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:16,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:16,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189219356] [2024-11-10 18:02:16,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189219356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:16,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:16,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:02:16,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678588296] [2024-11-10 18:02:16,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:16,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:02:16,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:16,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:02:16,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:02:16,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:16,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-10 18:02:16,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:16,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:16,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:17,064 INFO L124 PetriNetUnfolderBase]: 1605/2479 cut-off events. [2024-11-10 18:02:17,064 INFO L125 PetriNetUnfolderBase]: For 1894/1894 co-relation queries the response was YES. [2024-11-10 18:02:17,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6496 conditions, 2479 events. 1605/2479 cut-off events. For 1894/1894 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 11059 event pairs, 233 based on Foata normal form. 0/2308 useless extension candidates. Maximal degree in co-relation 6481. Up to 2096 conditions per place. [2024-11-10 18:02:17,072 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 45 selfloop transitions, 6 changer transitions 0/58 dead transitions. [2024-11-10 18:02:17,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 58 transitions, 342 flow [2024-11-10 18:02:17,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:02:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:02:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2024-11-10 18:02:17,074 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.18526785714285715 [2024-11-10 18:02:17,074 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 192 flow. Second operand 4 states and 83 transitions. [2024-11-10 18:02:17,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 58 transitions, 342 flow [2024-11-10 18:02:17,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 270 flow, removed 10 selfloop flow, removed 8 redundant places. [2024-11-10 18:02:17,079 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 146 flow [2024-11-10 18:02:17,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2024-11-10 18:02:17,080 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -36 predicate places. [2024-11-10 18:02:17,080 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 146 flow [2024-11-10 18:02:17,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-10 18:02:17,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:17,081 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-11-10 18:02:17,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 18:02:17,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:17,285 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:17,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1674020846, now seen corresponding path program 1 times [2024-11-10 18:02:17,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:17,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21769451] [2024-11-10 18:02:17,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:17,286 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-11-10 18:02:17,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:17,287 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:17,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-10 18:02:17,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:17,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:02:17,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:17,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:17,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:17,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:17,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21769451] [2024-11-10 18:02:17,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21769451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:17,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:17,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 18:02:17,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529606548] [2024-11-10 18:02:17,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:17,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 18:02:17,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:17,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 18:02:17,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 18:02:17,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:17,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-10 18:02:17,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:17,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:17,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:17,877 INFO L124 PetriNetUnfolderBase]: 1581/2439 cut-off events. [2024-11-10 18:02:17,878 INFO L125 PetriNetUnfolderBase]: For 442/442 co-relation queries the response was YES. [2024-11-10 18:02:17,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5744 conditions, 2439 events. 1581/2439 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10836 event pairs, 225 based on Foata normal form. 0/2284 useless extension candidates. Maximal degree in co-relation 5733. Up to 2056 conditions per place. [2024-11-10 18:02:17,886 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 44 selfloop transitions, 6 changer transitions 0/57 dead transitions. [2024-11-10 18:02:17,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 278 flow [2024-11-10 18:02:17,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 18:02:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 18:02:17,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2024-11-10 18:02:17,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.18303571428571427 [2024-11-10 18:02:17,887 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 146 flow. Second operand 4 states and 82 transitions. [2024-11-10 18:02:17,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 278 flow [2024-11-10 18:02:17,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 271 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:02:17,889 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 149 flow [2024-11-10 18:02:17,889 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-11-10 18:02:17,890 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -36 predicate places. [2024-11-10 18:02:17,890 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 149 flow [2024-11-10 18:02:17,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 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-11-10 18:02:17,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:17,890 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-11-10 18:02:17,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-10 18:02:18,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:18,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:18,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 271381525, now seen corresponding path program 1 times [2024-11-10 18:02:18,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:18,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569553229] [2024-11-10 18:02:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:18,092 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-11-10 18:02:18,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:18,095 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:18,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-10 18:02:18,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:18,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 18:02:18,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:18,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:18,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:18,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:18,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569553229] [2024-11-10 18:02:18,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569553229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:18,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:18,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-10 18:02:18,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883008403] [2024-11-10 18:02:18,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:18,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 18:02:18,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:18,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 18:02:18,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 18:02:18,295 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 112 [2024-11-10 18:02:18,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 149 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-10 18:02:18,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:18,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 112 [2024-11-10 18:02:18,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:18,532 INFO L124 PetriNetUnfolderBase]: 1581/2423 cut-off events. [2024-11-10 18:02:18,533 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2024-11-10 18:02:18,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5932 conditions, 2423 events. 1581/2423 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10891 event pairs, 1321 based on Foata normal form. 16/2284 useless extension candidates. Maximal degree in co-relation 5921. Up to 2366 conditions per place. [2024-11-10 18:02:18,541 INFO L140 encePairwiseOnDemand]: 110/112 looper letters, 36 selfloop transitions, 1 changer transitions 1/44 dead transitions. [2024-11-10 18:02:18,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 44 transitions, 223 flow [2024-11-10 18:02:18,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 18:02:18,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 18:02:18,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2024-11-10 18:02:18,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.17559523809523808 [2024-11-10 18:02:18,542 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 149 flow. Second operand 3 states and 59 transitions. [2024-11-10 18:02:18,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 44 transitions, 223 flow [2024-11-10 18:02:18,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 18:02:18,543 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 140 flow [2024-11-10 18:02:18,543 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=140, 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=140, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2024-11-10 18:02:18,543 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -37 predicate places. [2024-11-10 18:02:18,544 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 140 flow [2024-11-10 18:02:18,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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-11-10 18:02:18,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:18,544 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-11-10 18:02:18,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-10 18:02:18,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:18,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:18,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash -662073320, now seen corresponding path program 1 times [2024-11-10 18:02:18,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:18,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399556992] [2024-11-10 18:02:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 18:02:18,746 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-11-10 18:02:18,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:18,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:18,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-10 18:02:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 18:02:18,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 18:02:18,891 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 18:02:18,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 18:02:18,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 18:02:18,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 18:02:18,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399556992] [2024-11-10 18:02:18,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399556992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 18:02:18,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 18:02:18,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 18:02:18,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251474909] [2024-11-10 18:02:18,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 18:02:18,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 18:02:18,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 18:02:18,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 18:02:18,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 18:02:18,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 112 [2024-11-10 18:02:18,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 140 flow. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-10 18:02:18,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 18:02:18,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 112 [2024-11-10 18:02:18,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 18:02:19,488 INFO L124 PetriNetUnfolderBase]: 2335/3617 cut-off events. [2024-11-10 18:02:19,488 INFO L125 PetriNetUnfolderBase]: For 488/488 co-relation queries the response was YES. [2024-11-10 18:02:19,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8586 conditions, 3617 events. 2335/3617 cut-off events. For 488/488 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 17786 event pairs, 413 based on Foata normal form. 16/3478 useless extension candidates. Maximal degree in co-relation 8575. Up to 1392 conditions per place. [2024-11-10 18:02:19,509 INFO L140 encePairwiseOnDemand]: 106/112 looper letters, 49 selfloop transitions, 3 changer transitions 26/84 dead transitions. [2024-11-10 18:02:19,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 84 transitions, 409 flow [2024-11-10 18:02:19,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 18:02:19,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 18:02:19,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2024-11-10 18:02:19,514 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.18452380952380953 [2024-11-10 18:02:19,514 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 140 flow. Second operand 6 states and 124 transitions. [2024-11-10 18:02:19,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 84 transitions, 409 flow [2024-11-10 18:02:19,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 408 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 18:02:19,518 INFO L231 Difference]: Finished difference. Result has 59 places, 43 transitions, 153 flow [2024-11-10 18:02:19,520 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=153, PETRI_PLACES=59, PETRI_TRANSITIONS=43} [2024-11-10 18:02:19,520 INFO L277 CegarLoopForPetriNet]: 90 programPoint places, -31 predicate places. [2024-11-10 18:02:19,521 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 43 transitions, 153 flow [2024-11-10 18:02:19,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-11-10 18:02:19,522 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 18:02:19,522 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-11-10 18:02:19,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 18:02:19,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 18:02:19,723 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2024-11-10 18:02:19,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 18:02:19,724 INFO L85 PathProgramCache]: Analyzing trace with hash -351474244, now seen corresponding path program 2 times [2024-11-10 18:02:19,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 18:02:19,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190981408] [2024-11-10 18:02:19,728 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 18:02:19,728 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-11-10 18:02:19,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 18:02:19,732 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 18:02:19,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-10 18:02:19,903 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-10 18:02:19,903 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 18:02:19,907 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 22 conjuncts are in the unsatisfiable core