./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:25:38,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:25:38,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:25:38,639 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:25:38,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:25:38,658 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:25:38,659 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:25:38,659 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:25:38,660 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:25:38,660 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:25:38,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:25:38,661 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:25:38,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:25:38,662 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:25:38,662 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:25:38,663 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:25:38,663 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:25:38,663 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:25:38,664 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:25:38,664 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:25:38,664 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:25:38,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:25:38,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:25:38,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:25:38,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:25:38,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:25:38,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:25:38,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:25:38,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:25:38,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:25:38,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:25:38,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:25:38,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:25:38,670 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:25:38,670 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:25:38,671 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:25:38,671 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:25:38,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:25:38,671 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:25:38,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:25:38,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:25:38,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:25:38,672 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 ! call(reach_error())) ) 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 -> 6883737711af32a6a824eca7af237353e2fdaf7712a6b3c22083c0d47b565ee7 [2024-11-10 10:25:38,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:25:38,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:25:38,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:25:38,952 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:25:38,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:25:38,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-11-10 10:25:40,467 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:25:40,776 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:25:40,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-11-10 10:25:40,801 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56aa15d8c/80d1fe0e583c45c7a3b2d5ededd6ea82/FLAG46f3bd94d [2024-11-10 10:25:40,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56aa15d8c/80d1fe0e583c45c7a3b2d5ededd6ea82 [2024-11-10 10:25:40,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:25:40,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:25:40,823 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:25:40,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:25:40,829 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:25:40,830 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:40" (1/1) ... [2024-11-10 10:25:40,830 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59712e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:40, skipping insertion in model container [2024-11-10 10:25:40,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:40" (1/1) ... [2024-11-10 10:25:40,878 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:25:41,083 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2024-11-10 10:25:41,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:25:41,268 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:25:41,280 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i[1120,1133] [2024-11-10 10:25:41,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:25:41,351 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:25:41,352 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41 WrapperNode [2024-11-10 10:25:41,352 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:25:41,353 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:25:41,354 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:25:41,354 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:25:41,361 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,382 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,408 INFO L138 Inliner]: procedures = 165, calls = 46, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 162 [2024-11-10 10:25:41,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:25:41,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:25:41,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:25:41,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:25:41,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,425 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,440 INFO L175 MemorySlicer]: Split 17 memory accesses to 4 slices as follows [2, 5, 5, 5]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 5, 5, 5]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-10 10:25:41,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,441 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,447 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,448 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,449 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,450 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:25:41,454 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:25:41,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:25:41,460 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:25:41,461 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (1/1) ... [2024-11-10 10:25:41,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:25:41,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:25:41,490 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 10:25:41,492 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 10:25:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:25:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:25:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 10:25:41,534 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 10:25:41,534 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:25:41,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:25:41,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:25:41,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 10:25:41,535 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:25:41,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:25:41,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:25:41,537 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 10:25:41,668 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:25:41,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:25:42,000 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:25:42,000 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:25:42,226 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:25:42,226 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:25:42,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:25:42 BoogieIcfgContainer [2024-11-10 10:25:42,227 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:25:42,228 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:25:42,228 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:25:42,232 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:25:42,232 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:25:40" (1/3) ... [2024-11-10 10:25:42,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddc264b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:25:42, skipping insertion in model container [2024-11-10 10:25:42,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:41" (2/3) ... [2024-11-10 10:25:42,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddc264b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:25:42, skipping insertion in model container [2024-11-10 10:25:42,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:25:42" (3/3) ... [2024-11-10 10:25:42,235 INFO L112 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2024-11-10 10:25:42,252 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:25:42,252 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-10 10:25:42,252 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:25:42,300 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 10:25:42,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 53 places, 54 transitions, 112 flow [2024-11-10 10:25:42,370 INFO L124 PetriNetUnfolderBase]: 4/54 cut-off events. [2024-11-10 10:25:42,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:25:42,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58 conditions, 54 events. 4/54 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 75 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-10 10:25:42,374 INFO L82 GeneralOperation]: Start removeDead. Operand has 53 places, 54 transitions, 112 flow [2024-11-10 10:25:42,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 45 places, 43 transitions, 89 flow [2024-11-10 10:25:42,392 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:25:42,402 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=LoopHeads, 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;@60a8031e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:25:42,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2024-11-10 10:25:42,414 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:25:42,415 INFO L124 PetriNetUnfolderBase]: 1/21 cut-off events. [2024-11-10 10:25:42,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:25:42,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:42,417 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:25:42,418 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:42,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:42,424 INFO L85 PathProgramCache]: Analyzing trace with hash 111067319, now seen corresponding path program 1 times [2024-11-10 10:25:42,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:42,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535039] [2024-11-10 10:25:42,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:42,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:42,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:42,972 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 10:25:42,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:42,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535039] [2024-11-10 10:25:42,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:42,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:42,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:25:42,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140001150] [2024-11-10 10:25:42,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:25:42,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:43,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:25:43,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:25:43,029 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-10 10:25:43,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 89 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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 10:25:43,033 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:43,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-10 10:25:43,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:43,300 INFO L124 PetriNetUnfolderBase]: 202/488 cut-off events. [2024-11-10 10:25:43,302 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:25:43,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 929 conditions, 488 events. 202/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2188 event pairs, 47 based on Foata normal form. 41/499 useless extension candidates. Maximal degree in co-relation 918. Up to 252 conditions per place. [2024-11-10 10:25:43,309 INFO L140 encePairwiseOnDemand]: 42/54 looper letters, 44 selfloop transitions, 7 changer transitions 8/67 dead transitions. [2024-11-10 10:25:43,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 67 transitions, 255 flow [2024-11-10 10:25:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:25:43,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:25:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 136 transitions. [2024-11-10 10:25:43,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037037037037037 [2024-11-10 10:25:43,328 INFO L175 Difference]: Start difference. First operand has 45 places, 43 transitions, 89 flow. Second operand 5 states and 136 transitions. [2024-11-10 10:25:43,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 67 transitions, 255 flow [2024-11-10 10:25:43,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 67 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:25:43,335 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 116 flow [2024-11-10 10:25:43,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2024-11-10 10:25:43,345 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2024-11-10 10:25:43,345 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 116 flow [2024-11-10 10:25:43,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 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 10:25:43,347 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:43,347 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:25:43,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:25:43,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:43,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:43,348 INFO L85 PathProgramCache]: Analyzing trace with hash 576971450, now seen corresponding path program 1 times [2024-11-10 10:25:43,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:43,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101956500] [2024-11-10 10:25:43,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:43,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:43,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:43,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 10:25:43,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:43,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101956500] [2024-11-10 10:25:43,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101956500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:25:43,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408355683] [2024-11-10 10:25:43,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:43,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:25:43,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:25:43,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:25:43,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 54 [2024-11-10 10:25:43,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 10:25:43,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:43,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 54 [2024-11-10 10:25:43,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:43,929 INFO L124 PetriNetUnfolderBase]: 171/435 cut-off events. [2024-11-10 10:25:43,930 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2024-11-10 10:25:43,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 435 events. 171/435 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1937 event pairs, 69 based on Foata normal form. 15/446 useless extension candidates. Maximal degree in co-relation 962. Up to 204 conditions per place. [2024-11-10 10:25:43,934 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 36 selfloop transitions, 4 changer transitions 38/86 dead transitions. [2024-11-10 10:25:43,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 86 transitions, 380 flow [2024-11-10 10:25:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 10:25:43,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-10 10:25:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 183 transitions. [2024-11-10 10:25:43,936 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4236111111111111 [2024-11-10 10:25:43,937 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 116 flow. Second operand 8 states and 183 transitions. [2024-11-10 10:25:43,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 86 transitions, 380 flow [2024-11-10 10:25:43,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 86 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 10:25:43,941 INFO L231 Difference]: Finished difference. Result has 57 places, 35 transitions, 110 flow [2024-11-10 10:25:43,942 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=110, PETRI_PLACES=57, PETRI_TRANSITIONS=35} [2024-11-10 10:25:43,942 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 12 predicate places. [2024-11-10 10:25:43,943 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 35 transitions, 110 flow [2024-11-10 10:25:43,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 10:25:43,943 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:43,943 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:25:43,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:25:43,944 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:43,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash -893664297, now seen corresponding path program 1 times [2024-11-10 10:25:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:43,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113484912] [2024-11-10 10:25:43,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:43,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:44,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 10:25:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:44,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113484912] [2024-11-10 10:25:44,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113484912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:44,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:44,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:25:44,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756532271] [2024-11-10 10:25:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:44,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:25:44,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:44,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:25:44,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:25:44,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-10 10:25:44,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 35 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 10:25:44,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:44,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-10 10:25:44,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:44,199 INFO L124 PetriNetUnfolderBase]: 116/298 cut-off events. [2024-11-10 10:25:44,200 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-11-10 10:25:44,201 INFO L83 FinitePrefix]: Finished finitePrefix Result has 747 conditions, 298 events. 116/298 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1183 event pairs, 55 based on Foata normal form. 11/307 useless extension candidates. Maximal degree in co-relation 725. Up to 178 conditions per place. [2024-11-10 10:25:44,203 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2024-11-10 10:25:44,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 55 transitions, 272 flow [2024-11-10 10:25:44,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:25:44,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:25:44,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2024-11-10 10:25:44,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44074074074074077 [2024-11-10 10:25:44,205 INFO L175 Difference]: Start difference. First operand has 57 places, 35 transitions, 110 flow. Second operand 5 states and 119 transitions. [2024-11-10 10:25:44,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 55 transitions, 272 flow [2024-11-10 10:25:44,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 212 flow, removed 10 selfloop flow, removed 13 redundant places. [2024-11-10 10:25:44,210 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 122 flow [2024-11-10 10:25:44,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=122, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2024-11-10 10:25:44,211 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 2 predicate places. [2024-11-10 10:25:44,212 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 122 flow [2024-11-10 10:25:44,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 0 states have call successors, (0), 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 10:25:44,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:44,213 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 10:25:44,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:25:44,213 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:44,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:44,214 INFO L85 PathProgramCache]: Analyzing trace with hash 153339049, now seen corresponding path program 1 times [2024-11-10 10:25:44,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:44,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38807954] [2024-11-10 10:25:44,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:44,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:44,327 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 10:25:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:44,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38807954] [2024-11-10 10:25:44,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38807954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:44,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:44,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:25:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30413062] [2024-11-10 10:25:44,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:44,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:25:44,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:44,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:25:44,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:25:44,339 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-10 10:25:44,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 122 flow. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 10:25:44,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:44,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-10 10:25:44,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:44,467 INFO L124 PetriNetUnfolderBase]: 109/277 cut-off events. [2024-11-10 10:25:44,469 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2024-11-10 10:25:44,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 637 conditions, 277 events. 109/277 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1059 event pairs, 41 based on Foata normal form. 8/283 useless extension candidates. Maximal degree in co-relation 622. Up to 146 conditions per place. [2024-11-10 10:25:44,471 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 10 changer transitions 0/56 dead transitions. [2024-11-10 10:25:44,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 264 flow [2024-11-10 10:25:44,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:25:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:25:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2024-11-10 10:25:44,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.404320987654321 [2024-11-10 10:25:44,475 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 122 flow. Second operand 6 states and 131 transitions. [2024-11-10 10:25:44,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 264 flow [2024-11-10 10:25:44,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 254 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-10 10:25:44,477 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 139 flow [2024-11-10 10:25:44,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=139, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2024-11-10 10:25:44,478 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 3 predicate places. [2024-11-10 10:25:44,478 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 139 flow [2024-11-10 10:25:44,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 0 states have call successors, (0), 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 10:25:44,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:44,479 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 10:25:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:25:44,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:44,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:44,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1140173350, now seen corresponding path program 1 times [2024-11-10 10:25:44,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:44,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26077274] [2024-11-10 10:25:44,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:44,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:44,616 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 10:25:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26077274] [2024-11-10 10:25:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26077274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:25:44,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566047747] [2024-11-10 10:25:44,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:44,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:25:44,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:44,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:25:44,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:25:44,620 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54 [2024-11-10 10:25:44,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 10:25:44,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:44,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54 [2024-11-10 10:25:44,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:44,715 INFO L124 PetriNetUnfolderBase]: 75/221 cut-off events. [2024-11-10 10:25:44,716 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-11-10 10:25:44,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 221 events. 75/221 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 800 event pairs, 23 based on Foata normal form. 11/230 useless extension candidates. Maximal degree in co-relation 507. Up to 103 conditions per place. [2024-11-10 10:25:44,717 INFO L140 encePairwiseOnDemand]: 47/54 looper letters, 39 selfloop transitions, 7 changer transitions 2/57 dead transitions. [2024-11-10 10:25:44,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 57 transitions, 293 flow [2024-11-10 10:25:44,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:25:44,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:25:44,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2024-11-10 10:25:44,719 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5138888888888888 [2024-11-10 10:25:44,720 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 139 flow. Second operand 4 states and 111 transitions. [2024-11-10 10:25:44,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 57 transitions, 293 flow [2024-11-10 10:25:44,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 57 transitions, 284 flow, removed 4 selfloop flow, removed 1 redundant places. [2024-11-10 10:25:44,724 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 154 flow [2024-11-10 10:25:44,724 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=130, 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=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=154, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2024-11-10 10:25:44,725 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2024-11-10 10:25:44,726 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 154 flow [2024-11-10 10:25:44,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 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 10:25:44,726 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:44,726 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 10:25:44,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:25:44,727 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:44,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1562810684, now seen corresponding path program 1 times [2024-11-10 10:25:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:44,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966611722] [2024-11-10 10:25:44,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:44,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:44,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:44,857 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 10:25:44,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:44,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966611722] [2024-11-10 10:25:44,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966611722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:44,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:44,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:25:44,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204686805] [2024-11-10 10:25:44,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:44,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:25:44,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:44,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:25:44,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:25:44,860 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 54 [2024-11-10 10:25:44,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 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 10:25:44,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:44,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 54 [2024-11-10 10:25:44,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:44,949 INFO L124 PetriNetUnfolderBase]: 75/227 cut-off events. [2024-11-10 10:25:44,949 INFO L125 PetriNetUnfolderBase]: For 115/115 co-relation queries the response was YES. [2024-11-10 10:25:44,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 570 conditions, 227 events. 75/227 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 812 event pairs, 29 based on Foata normal form. 2/229 useless extension candidates. Maximal degree in co-relation 553. Up to 106 conditions per place. [2024-11-10 10:25:44,951 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 36 selfloop transitions, 5 changer transitions 3/52 dead transitions. [2024-11-10 10:25:44,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 52 transitions, 281 flow [2024-11-10 10:25:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:25:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:25:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2024-11-10 10:25:44,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49074074074074076 [2024-11-10 10:25:44,952 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 154 flow. Second operand 4 states and 106 transitions. [2024-11-10 10:25:44,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 52 transitions, 281 flow [2024-11-10 10:25:44,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:25:44,955 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 156 flow [2024-11-10 10:25:44,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2024-11-10 10:25:44,956 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2024-11-10 10:25:44,956 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 156 flow [2024-11-10 10:25:44,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 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 10:25:44,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:25:44,957 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] [2024-11-10 10:25:44,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:25:44,957 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr2ASSERT_VIOLATIONERROR_FUNCTION, t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2024-11-10 10:25:44,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:25:44,958 INFO L85 PathProgramCache]: Analyzing trace with hash -282299740, now seen corresponding path program 1 times [2024-11-10 10:25:44,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:25:44,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916828856] [2024-11-10 10:25:44,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:25:44,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:25:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:25:45,125 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 10:25:45,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:25:45,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916828856] [2024-11-10 10:25:45,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916828856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:25:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:25:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 10:25:45,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053678000] [2024-11-10 10:25:45,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:25:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:25:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:25:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:25:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:25:45,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 54 [2024-11-10 10:25:45,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 10:25:45,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:25:45,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 54 [2024-11-10 10:25:45,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:25:45,302 INFO L124 PetriNetUnfolderBase]: 74/206 cut-off events. [2024-11-10 10:25:45,302 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2024-11-10 10:25:45,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 582 conditions, 206 events. 74/206 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 681 event pairs, 14 based on Foata normal form. 12/216 useless extension candidates. Maximal degree in co-relation 563. Up to 47 conditions per place. [2024-11-10 10:25:45,303 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 0 selfloop transitions, 0 changer transitions 58/58 dead transitions. [2024-11-10 10:25:45,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 58 transitions, 338 flow [2024-11-10 10:25:45,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 10:25:45,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-10 10:25:45,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 176 transitions. [2024-11-10 10:25:45,305 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36213991769547327 [2024-11-10 10:25:45,305 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 156 flow. Second operand 9 states and 176 transitions. [2024-11-10 10:25:45,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 58 transitions, 338 flow [2024-11-10 10:25:45,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 319 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 10:25:45,307 INFO L231 Difference]: Finished difference. Result has 54 places, 0 transitions, 0 flow [2024-11-10 10:25:45,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=54, PETRI_TRANSITIONS=0} [2024-11-10 10:25:45,308 INFO L277 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2024-11-10 10:25:45,308 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 0 transitions, 0 flow [2024-11-10 10:25:45,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 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 10:25:45,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2024-11-10 10:25:45,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2024-11-10 10:25:45,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2024-11-10 10:25:45,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2024-11-10 10:25:45,312 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 7 remaining) [2024-11-10 10:25:45,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2024-11-10 10:25:45,313 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2024-11-10 10:25:45,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:25:45,313 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:25:45,318 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:25:45,318 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:25:45,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:25:45 BasicIcfg [2024-11-10 10:25:45,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:25:45,324 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:25:45,324 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:25:45,324 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:25:45,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:25:42" (3/4) ... [2024-11-10 10:25:45,327 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 10:25:45,330 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2024-11-10 10:25:45,334 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2024-11-10 10:25:45,335 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-10 10:25:45,335 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-10 10:25:45,335 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-10 10:25:45,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:25:45,429 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 10:25:45,429 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:25:45,429 INFO L158 Benchmark]: Toolchain (without parser) took 4608.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 136.6MB in the beginning and 115.3MB in the end (delta: 21.3MB). Peak memory consumption was 55.1MB. Max. memory is 16.1GB. [2024-11-10 10:25:45,430 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:25:45,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 529.45ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 113.7MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:25:45,430 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.41ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 110.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:25:45,431 INFO L158 Benchmark]: Boogie Preprocessor took 42.54ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:25:45,431 INFO L158 Benchmark]: IcfgBuilder took 772.29ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 59.2MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-10 10:25:45,431 INFO L158 Benchmark]: TraceAbstraction took 3095.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 59.2MB in the beginning and 119.4MB in the end (delta: -60.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:25:45,431 INFO L158 Benchmark]: Witness Printer took 104.93ms. Allocated memory is still 201.3MB. Free memory was 119.4MB in the beginning and 115.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 10:25:45,433 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.19ms. Allocated memory is still 125.8MB. Free memory is still 87.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 529.45ms. Allocated memory is still 167.8MB. Free memory was 136.6MB in the beginning and 113.7MB in the end (delta: 22.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.41ms. Allocated memory is still 167.8MB. Free memory was 113.7MB in the beginning and 110.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.54ms. Allocated memory is still 167.8MB. Free memory was 110.5MB in the beginning and 108.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 772.29ms. Allocated memory is still 167.8MB. Free memory was 108.4MB in the beginning and 59.2MB in the end (delta: 49.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3095.12ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 59.2MB in the beginning and 119.4MB in the end (delta: -60.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 104.93ms. Allocated memory is still 201.3MB. Free memory was 119.4MB in the beginning and 115.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 79 locations, 7 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: 3.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 292 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 38 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 727 IncrementalHoareTripleChecker+Invalid, 769 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 6 mSDtfsCounter, 727 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=6, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 123 ConstructedInterpolants, 0 QuantifiedInterpolants, 468 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 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 - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 10:25:45,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE