./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.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/13-privatized_24-multiple-protecting_true.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 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 10:22:24,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 10:22:24,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 10:22:24,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 10:22:24,784 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 10:22:24,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 10:22:24,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 10:22:24,805 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 10:22:24,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 10:22:24,806 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 10:22:24,806 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 10:22:24,806 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 10:22:24,807 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 10:22:24,807 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 10:22:24,808 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 10:22:24,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 10:22:24,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 10:22:24,809 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 10:22:24,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 10:22:24,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 10:22:24,814 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 10:22:24,814 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 10:22:24,814 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 10:22:24,815 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 10:22:24,815 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 10:22:24,815 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 10:22:24,815 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 10:22:24,815 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 10:22:24,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 10:22:24,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 10:22:24,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 10:22:24,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 10:22:24,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:22:24,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 10:22:24,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 10:22:24,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 10:22:24,819 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 10:22:24,819 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 10:22:24,819 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 10:22:24,820 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 10:22:24,820 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 10:22:24,821 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 10:22:24,821 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 -> 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf [2024-11-10 10:22:25,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 10:22:25,117 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 10:22:25,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 10:22:25,122 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 10:22:25,122 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 10:22:25,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-11-10 10:22:26,582 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 10:22:26,833 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 10:22:26,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2024-11-10 10:22:26,853 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c576a750/d9d3b6061a0d43d996deb3482ac40560/FLAG73da1479c [2024-11-10 10:22:27,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c576a750/d9d3b6061a0d43d996deb3482ac40560 [2024-11-10 10:22:27,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 10:22:27,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 10:22:27,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 10:22:27,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 10:22:27,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 10:22:27,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e60df07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27, skipping insertion in model container [2024-11-10 10:22:27,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 10:22:27,453 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/13-privatized_24-multiple-protecting_true.i[1096,1109] [2024-11-10 10:22:27,618 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:22:27,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 10:22:27,665 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/13-privatized_24-multiple-protecting_true.i[1096,1109] [2024-11-10 10:22:27,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 10:22:27,754 INFO L204 MainTranslator]: Completed translation [2024-11-10 10:22:27,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27 WrapperNode [2024-11-10 10:22:27,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 10:22:27,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 10:22:27,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 10:22:27,757 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 10:22:27,764 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:22:27" (1/1) ... [2024-11-10 10:22:27,784 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:22:27" (1/1) ... [2024-11-10 10:22:27,813 INFO L138 Inliner]: procedures = 162, calls = 53, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 101 [2024-11-10 10:22:27,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 10:22:27,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 10:22:27,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 10:22:27,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 10:22:27,827 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,846 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:22:27,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,851 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 10:22:27,865 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 10:22:27,867 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 10:22:27,867 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 10:22:27,868 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (1/1) ... [2024-11-10 10:22:27,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 10:22:27,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 10:22:27,901 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:22:27,904 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:22:27,956 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 10:22:27,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 10:22:27,957 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-10 10:22:27,957 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-10 10:22:27,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 10:22:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 10:22:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 10:22:27,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-10 10:22:27,959 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 10:22:27,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 10:22:27,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 10:22:27,962 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:22:28,105 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 10:22:28,107 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 10:22:28,374 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 10:22:28,374 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 10:22:28,528 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 10:22:28,528 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 10:22:28,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:22:28 BoogieIcfgContainer [2024-11-10 10:22:28,529 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 10:22:28,531 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 10:22:28,531 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 10:22:28,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 10:22:28,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 10:22:27" (1/3) ... [2024-11-10 10:22:28,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6face308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:22:28, skipping insertion in model container [2024-11-10 10:22:28,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:22:27" (2/3) ... [2024-11-10 10:22:28,538 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6face308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 10:22:28, skipping insertion in model container [2024-11-10 10:22:28,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:22:28" (3/3) ... [2024-11-10 10:22:28,540 INFO L112 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2024-11-10 10:22:28,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 10:22:28,555 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-10 10:22:28,555 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 10:22:28,607 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-10 10:22:28,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 75 transitions, 157 flow [2024-11-10 10:22:28,704 INFO L124 PetriNetUnfolderBase]: 4/74 cut-off events. [2024-11-10 10:22:28,704 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-10 10:22:28,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 74 events. 4/74 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 80 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-10 10:22:28,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 75 transitions, 157 flow [2024-11-10 10:22:28,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 66 places, 65 transitions, 133 flow [2024-11-10 10:22:28,723 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 10:22:28,730 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;@72ac3a1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 10:22:28,730 INFO L334 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2024-11-10 10:22:28,738 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 10:22:28,738 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2024-11-10 10:22:28,738 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:22:28,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:28,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:28,742 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:28,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:28,749 INFO L85 PathProgramCache]: Analyzing trace with hash -74180497, now seen corresponding path program 1 times [2024-11-10 10:22:28,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:28,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198973058] [2024-11-10 10:22:28,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:28,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:29,153 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:22:29,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:29,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198973058] [2024-11-10 10:22:29,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198973058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:29,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:29,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:22:29,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971244173] [2024-11-10 10:22:29,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:29,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:22:29,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:22:29,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:22:29,212 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-10 10:22:29,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 65 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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:22:29,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:29,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-10 10:22:29,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:29,649 INFO L124 PetriNetUnfolderBase]: 443/1135 cut-off events. [2024-11-10 10:22:29,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 10:22:29,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2088 conditions, 1135 events. 443/1135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 6249 event pairs, 116 based on Foata normal form. 66/1148 useless extension candidates. Maximal degree in co-relation 2079. Up to 670 conditions per place. [2024-11-10 10:22:29,664 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 69 selfloop transitions, 15 changer transitions 1/103 dead transitions. [2024-11-10 10:22:29,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 103 transitions, 379 flow [2024-11-10 10:22:29,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:22:29,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:22:29,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 200 transitions. [2024-11-10 10:22:29,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2024-11-10 10:22:29,681 INFO L175 Difference]: Start difference. First operand has 66 places, 65 transitions, 133 flow. Second operand 5 states and 200 transitions. [2024-11-10 10:22:29,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 103 transitions, 379 flow [2024-11-10 10:22:29,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:29,692 INFO L231 Difference]: Finished difference. Result has 73 places, 71 transitions, 226 flow [2024-11-10 10:22:29,694 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=226, PETRI_PLACES=73, PETRI_TRANSITIONS=71} [2024-11-10 10:22:29,698 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 7 predicate places. [2024-11-10 10:22:29,698 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 71 transitions, 226 flow [2024-11-10 10:22:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 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:22:29,699 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:29,699 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:29,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 10:22:29,699 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash 206896040, now seen corresponding path program 1 times [2024-11-10 10:22:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255793337] [2024-11-10 10:22:29,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:29,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:29,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:29,899 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:22:29,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:29,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255793337] [2024-11-10 10:22:29,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255793337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:29,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:29,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:22:29,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692468135] [2024-11-10 10:22:29,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:29,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:22:29,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:29,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:22:29,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:22:29,905 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-11-10 10:22:29,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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:22:29,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:29,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-11-10 10:22:29,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:30,113 INFO L124 PetriNetUnfolderBase]: 242/724 cut-off events. [2024-11-10 10:22:30,113 INFO L125 PetriNetUnfolderBase]: For 146/146 co-relation queries the response was YES. [2024-11-10 10:22:30,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1569 conditions, 724 events. 242/724 cut-off events. For 146/146 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3824 event pairs, 28 based on Foata normal form. 22/744 useless extension candidates. Maximal degree in co-relation 1555. Up to 381 conditions per place. [2024-11-10 10:22:30,118 INFO L140 encePairwiseOnDemand]: 69/75 looper letters, 70 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2024-11-10 10:22:30,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 100 transitions, 462 flow [2024-11-10 10:22:30,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:22:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:22:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2024-11-10 10:22:30,123 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5766666666666667 [2024-11-10 10:22:30,124 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 226 flow. Second operand 4 states and 173 transitions. [2024-11-10 10:22:30,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 100 transitions, 462 flow [2024-11-10 10:22:30,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 437 flow, removed 8 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:30,133 INFO L231 Difference]: Finished difference. Result has 76 places, 72 transitions, 231 flow [2024-11-10 10:22:30,133 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=231, PETRI_PLACES=76, PETRI_TRANSITIONS=72} [2024-11-10 10:22:30,134 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-11-10 10:22:30,134 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 72 transitions, 231 flow [2024-11-10 10:22:30,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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:22:30,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:30,135 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:22:30,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 10:22:30,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:30,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -539111831, now seen corresponding path program 1 times [2024-11-10 10:22:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899765945] [2024-11-10 10:22:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:30,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:30,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:30,305 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:22:30,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:30,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899765945] [2024-11-10 10:22:30,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899765945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:30,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:30,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:22:30,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079128852] [2024-11-10 10:22:30,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:30,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:22:30,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:30,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:22:30,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:22:30,316 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-10 10:22:30,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 72 transitions, 231 flow. Second operand has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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:22:30,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:30,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-10 10:22:30,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:30,548 INFO L124 PetriNetUnfolderBase]: 251/704 cut-off events. [2024-11-10 10:22:30,549 INFO L125 PetriNetUnfolderBase]: For 123/123 co-relation queries the response was YES. [2024-11-10 10:22:30,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 704 events. 251/704 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3539 event pairs, 160 based on Foata normal form. 36/737 useless extension candidates. Maximal degree in co-relation 1565. Up to 434 conditions per place. [2024-11-10 10:22:30,552 INFO L140 encePairwiseOnDemand]: 62/75 looper letters, 48 selfloop transitions, 13 changer transitions 7/84 dead transitions. [2024-11-10 10:22:30,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 84 transitions, 397 flow [2024-11-10 10:22:30,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:22:30,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:22:30,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 165 transitions. [2024-11-10 10:22:30,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.44 [2024-11-10 10:22:30,554 INFO L175 Difference]: Start difference. First operand has 76 places, 72 transitions, 231 flow. Second operand 5 states and 165 transitions. [2024-11-10 10:22:30,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 84 transitions, 397 flow [2024-11-10 10:22:30,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 84 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:22:30,558 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 251 flow [2024-11-10 10:22:30,559 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-11-10 10:22:30,560 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 10 predicate places. [2024-11-10 10:22:30,560 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 251 flow [2024-11-10 10:22:30,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.0) internal successors, (120), 5 states have internal predecessors, (120), 0 states have call successors, (0), 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:22:30,560 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:30,560 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] [2024-11-10 10:22:30,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 10:22:30,561 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:30,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:30,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1919533601, now seen corresponding path program 1 times [2024-11-10 10:22:30,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:30,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078984828] [2024-11-10 10:22:30,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:30,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:30,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:30,649 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:22:30,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:30,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078984828] [2024-11-10 10:22:30,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078984828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:30,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 10:22:30,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92794272] [2024-11-10 10:22:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 10:22:30,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 10:22:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 10:22:30,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-10 10:22:30,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 251 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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:22:30,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:30,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-10 10:22:30,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:30,842 INFO L124 PetriNetUnfolderBase]: 194/597 cut-off events. [2024-11-10 10:22:30,842 INFO L125 PetriNetUnfolderBase]: For 285/285 co-relation queries the response was YES. [2024-11-10 10:22:30,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 597 events. 194/597 cut-off events. For 285/285 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2869 event pairs, 76 based on Foata normal form. 11/605 useless extension candidates. Maximal degree in co-relation 1416. Up to 281 conditions per place. [2024-11-10 10:22:30,846 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 57 selfloop transitions, 17 changer transitions 1/91 dead transitions. [2024-11-10 10:22:30,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 91 transitions, 493 flow [2024-11-10 10:22:30,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 10:22:30,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 10:22:30,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 175 transitions. [2024-11-10 10:22:30,848 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2024-11-10 10:22:30,848 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 251 flow. Second operand 5 states and 175 transitions. [2024-11-10 10:22:30,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 91 transitions, 493 flow [2024-11-10 10:22:30,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 91 transitions, 439 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-10 10:22:30,854 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 305 flow [2024-11-10 10:22:30,854 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=305, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2024-11-10 10:22:30,855 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 12 predicate places. [2024-11-10 10:22:30,855 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 305 flow [2024-11-10 10:22:30,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 0 states have call successors, (0), 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:22:30,855 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:30,855 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:30,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 10:22:30,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:30,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1007033188, now seen corresponding path program 1 times [2024-11-10 10:22:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348351183] [2024-11-10 10:22:30,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:30,991 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:22:30,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:30,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348351183] [2024-11-10 10:22:30,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348351183] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:30,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:30,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:22:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018366060] [2024-11-10 10:22:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:30,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:22:30,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:30,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:22:30,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:22:30,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-11-10 10:22:30,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 305 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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:22:30,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:30,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-11-10 10:22:30,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:31,133 INFO L124 PetriNetUnfolderBase]: 93/379 cut-off events. [2024-11-10 10:22:31,133 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-10 10:22:31,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 379 events. 93/379 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1616 event pairs, 23 based on Foata normal form. 43/415 useless extension candidates. Maximal degree in co-relation 972. Up to 177 conditions per place. [2024-11-10 10:22:31,136 INFO L140 encePairwiseOnDemand]: 58/75 looper letters, 44 selfloop transitions, 17 changer transitions 3/87 dead transitions. [2024-11-10 10:22:31,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 87 transitions, 501 flow [2024-11-10 10:22:31,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:22:31,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:22:31,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-10 10:22:31,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2024-11-10 10:22:31,137 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 305 flow. Second operand 4 states and 163 transitions. [2024-11-10 10:22:31,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 87 transitions, 501 flow [2024-11-10 10:22:31,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 87 transitions, 491 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-10 10:22:31,142 INFO L231 Difference]: Finished difference. Result has 81 places, 73 transitions, 360 flow [2024-11-10 10:22:31,142 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=360, PETRI_PLACES=81, PETRI_TRANSITIONS=73} [2024-11-10 10:22:31,143 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 15 predicate places. [2024-11-10 10:22:31,143 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 73 transitions, 360 flow [2024-11-10 10:22:31,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 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:22:31,143 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:31,144 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:31,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 10:22:31,144 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:31,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1243546312, now seen corresponding path program 1 times [2024-11-10 10:22:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:31,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547131204] [2024-11-10 10:22:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:31,482 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:22:31,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:31,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547131204] [2024-11-10 10:22:31,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547131204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:31,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:31,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:22:31,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482923316] [2024-11-10 10:22:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:31,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:22:31,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:31,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:22:31,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:22:31,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-11-10 10:22:31,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 73 transitions, 360 flow. Second operand has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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:22:31,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:31,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-11-10 10:22:31,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:31,603 INFO L124 PetriNetUnfolderBase]: 89/350 cut-off events. [2024-11-10 10:22:31,603 INFO L125 PetriNetUnfolderBase]: For 314/316 co-relation queries the response was YES. [2024-11-10 10:22:31,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1029 conditions, 350 events. 89/350 cut-off events. For 314/316 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1465 event pairs, 41 based on Foata normal form. 4/351 useless extension candidates. Maximal degree in co-relation 1007. Up to 245 conditions per place. [2024-11-10 10:22:31,605 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 44 selfloop transitions, 4 changer transitions 14/79 dead transitions. [2024-11-10 10:22:31,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 79 transitions, 499 flow [2024-11-10 10:22:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:22:31,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:22:31,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 148 transitions. [2024-11-10 10:22:31,607 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-11-10 10:22:31,607 INFO L175 Difference]: Start difference. First operand has 81 places, 73 transitions, 360 flow. Second operand 4 states and 148 transitions. [2024-11-10 10:22:31,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 79 transitions, 499 flow [2024-11-10 10:22:31,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 483 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 10:22:31,612 INFO L231 Difference]: Finished difference. Result has 79 places, 56 transitions, 261 flow [2024-11-10 10:22:31,612 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=79, PETRI_TRANSITIONS=56} [2024-11-10 10:22:31,613 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2024-11-10 10:22:31,614 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 56 transitions, 261 flow [2024-11-10 10:22:31,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 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:22:31,615 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:31,615 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:31,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 10:22:31,615 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:31,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:31,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1841857606, now seen corresponding path program 1 times [2024-11-10 10:22:31,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:31,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030194755] [2024-11-10 10:22:31,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:31,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:31,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:31,866 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:22:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:31,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030194755] [2024-11-10 10:22:31,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030194755] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:31,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:31,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 10:22:31,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808843037] [2024-11-10 10:22:31,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:31,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 10:22:31,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:31,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 10:22:31,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 10:22:31,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 75 [2024-11-10 10:22:31,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 56 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 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:22:31,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:31,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 75 [2024-11-10 10:22:31,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:31,968 INFO L124 PetriNetUnfolderBase]: 62/246 cut-off events. [2024-11-10 10:22:31,968 INFO L125 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2024-11-10 10:22:31,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 246 events. 62/246 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 751 event pairs, 20 based on Foata normal form. 13/257 useless extension candidates. Maximal degree in co-relation 675. Up to 111 conditions per place. [2024-11-10 10:22:31,970 INFO L140 encePairwiseOnDemand]: 71/75 looper letters, 39 selfloop transitions, 6 changer transitions 2/63 dead transitions. [2024-11-10 10:22:31,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 390 flow [2024-11-10 10:22:31,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 10:22:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-10 10:22:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2024-11-10 10:22:31,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2024-11-10 10:22:31,971 INFO L175 Difference]: Start difference. First operand has 79 places, 56 transitions, 261 flow. Second operand 4 states and 142 transitions. [2024-11-10 10:22:31,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 390 flow [2024-11-10 10:22:31,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 333 flow, removed 2 selfloop flow, removed 8 redundant places. [2024-11-10 10:22:31,974 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 211 flow [2024-11-10 10:22:31,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2024-11-10 10:22:31,977 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-10 10:22:31,977 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 211 flow [2024-11-10 10:22:31,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.666666666666668) internal successors, (178), 6 states have internal predecessors, (178), 0 states have call successors, (0), 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:22:31,978 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 10:22:31,978 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:31,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 10:22:31,978 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2024-11-10 10:22:31,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 10:22:31,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1408684135, now seen corresponding path program 1 times [2024-11-10 10:22:31,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 10:22:31,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465042197] [2024-11-10 10:22:31,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 10:22:31,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 10:22:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 10:22:32,147 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:22:32,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 10:22:32,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465042197] [2024-11-10 10:22:32,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465042197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 10:22:32,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 10:22:32,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 10:22:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486917717] [2024-11-10 10:22:32,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 10:22:32,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 10:22:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 10:22:32,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 10:22:32,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 10:22:32,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 75 [2024-11-10 10:22:32,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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:22:32,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 10:22:32,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 75 [2024-11-10 10:22:32,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 10:22:32,268 INFO L124 PetriNetUnfolderBase]: 67/240 cut-off events. [2024-11-10 10:22:32,268 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2024-11-10 10:22:32,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 240 events. 67/240 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 719 event pairs, 46 based on Foata normal form. 4/241 useless extension candidates. Maximal degree in co-relation 633. Up to 156 conditions per place. [2024-11-10 10:22:32,269 INFO L140 encePairwiseOnDemand]: 66/75 looper letters, 0 selfloop transitions, 0 changer transitions 61/61 dead transitions. [2024-11-10 10:22:32,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 349 flow [2024-11-10 10:22:32,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 10:22:32,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 10:22:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 171 transitions. [2024-11-10 10:22:32,271 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38 [2024-11-10 10:22:32,271 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 211 flow. Second operand 6 states and 171 transitions. [2024-11-10 10:22:32,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 349 flow [2024-11-10 10:22:32,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 335 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-10 10:22:32,272 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2024-11-10 10:22:32,273 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=75, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2024-11-10 10:22:32,273 INFO L277 CegarLoopForPetriNet]: 66 programPoint places, 0 predicate places. [2024-11-10 10:22:32,274 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2024-11-10 10:22:32,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 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:22:32,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2024-11-10 10:22:32,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2024-11-10 10:22:32,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2024-11-10 10:22:32,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2024-11-10 10:22:32,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2024-11-10 10:22:32,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 10:22:32,279 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 10:22:32,284 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 10:22:32,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 10:22:32,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 10:22:32 BasicIcfg [2024-11-10 10:22:32,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 10:22:32,296 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 10:22:32,296 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 10:22:32,296 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 10:22:32,297 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 10:22:28" (3/4) ... [2024-11-10 10:22:32,299 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 10:22:32,302 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2024-11-10 10:22:32,306 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 28 nodes and edges [2024-11-10 10:22:32,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-10 10:22:32,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-10 10:22:32,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 10:22:32,397 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 10:22:32,398 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 10:22:32,398 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 10:22:32,398 INFO L158 Benchmark]: Toolchain (without parser) took 5242.90ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 70.5MB in the beginning and 101.1MB in the end (delta: -30.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,399 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 10:22:32,399 INFO L158 Benchmark]: CACSL2BoogieTranslator took 598.73ms. Allocated memory is still 146.8MB. Free memory was 70.2MB in the beginning and 100.8MB in the end (delta: -30.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,399 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.26ms. Allocated memory is still 146.8MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,399 INFO L158 Benchmark]: Boogie Preprocessor took 49.93ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 96.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,400 INFO L158 Benchmark]: IcfgBuilder took 663.78ms. Allocated memory is still 146.8MB. Free memory was 96.6MB in the beginning and 58.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,400 INFO L158 Benchmark]: TraceAbstraction took 3764.23ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 58.2MB in the beginning and 106.4MB in the end (delta: -48.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,400 INFO L158 Benchmark]: Witness Printer took 102.08ms. Allocated memory is still 199.2MB. Free memory was 106.4MB in the beginning and 101.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 10:22:32,402 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.18ms. Allocated memory is still 146.8MB. Free memory is still 117.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 598.73ms. Allocated memory is still 146.8MB. Free memory was 70.2MB in the beginning and 100.8MB in the end (delta: -30.6MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.26ms. Allocated memory is still 146.8MB. Free memory was 100.8MB in the beginning and 99.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.93ms. Allocated memory is still 146.8MB. Free memory was 99.2MB in the beginning and 96.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 663.78ms. Allocated memory is still 146.8MB. Free memory was 96.6MB in the beginning and 58.9MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3764.23ms. Allocated memory was 146.8MB in the beginning and 199.2MB in the end (delta: 52.4MB). Free memory was 58.2MB in the beginning and 106.4MB in the end (delta: -48.2MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. * Witness Printer took 102.08ms. Allocated memory is still 199.2MB. Free memory was 106.4MB in the beginning and 101.1MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. 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 - 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, 99 locations, 5 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.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 313 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 309 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 833 IncrementalHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 9 mSDtfsCounter, 833 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=360occurred in iteration=5, InterpolantAutomatonStates: 37, 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.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 220 ConstructedInterpolants, 0 QuantifiedInterpolants, 1231 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-10 10:22:32,433 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