./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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/weaver/parallel-misc-4.wvr.c -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 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 19:27:15,229 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 19:27:15,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 19:27:15,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 19:27:15,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 19:27:15,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 19:27:15,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 19:27:15,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 19:27:15,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 19:27:15,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 19:27:15,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 19:27:15,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 19:27:15,346 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 19:27:15,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 19:27:15,347 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 19:27:15,347 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 19:27:15,348 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 19:27:15,348 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 19:27:15,348 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 19:27:15,348 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 19:27:15,349 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 19:27:15,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 19:27:15,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 19:27:15,354 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 19:27:15,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 19:27:15,354 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 19:27:15,355 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 19:27:15,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 19:27:15,355 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 19:27:15,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 19:27:15,357 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 19:27:15,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 19:27:15,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:27:15,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 19:27:15,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 19:27:15,358 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 19:27:15,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 19:27:15,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 19:27:15,359 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 19:27:15,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 19:27:15,360 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 19:27:15,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 19:27:15,360 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 -> 287b872f435ea31dbbf77f267944e24b96122b5f745db0674c91555289f3b84c [2024-11-16 19:27:15,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 19:27:15,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 19:27:15,653 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 19:27:15,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 19:27:15,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 19:27:15,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-16 19:27:17,156 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 19:27:17,344 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 19:27:17,345 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-4.wvr.c [2024-11-16 19:27:17,352 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620ad212f/6f6eb85eb5014a6bbac942610d21fc56/FLAG35d5950fa [2024-11-16 19:27:17,726 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620ad212f/6f6eb85eb5014a6bbac942610d21fc56 [2024-11-16 19:27:17,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 19:27:17,731 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 19:27:17,732 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 19:27:17,732 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 19:27:17,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 19:27:17,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:27:17" (1/1) ... [2024-11-16 19:27:17,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343d59d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:17, skipping insertion in model container [2024-11-16 19:27:17,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 07:27:17" (1/1) ... [2024-11-16 19:27:17,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 19:27:17,989 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/weaver/parallel-misc-4.wvr.c[2257,2270] [2024-11-16 19:27:17,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:27:18,007 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 19:27:18,035 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/weaver/parallel-misc-4.wvr.c[2257,2270] [2024-11-16 19:27:18,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 19:27:18,055 INFO L204 MainTranslator]: Completed translation [2024-11-16 19:27:18,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18 WrapperNode [2024-11-16 19:27:18,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 19:27:18,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 19:27:18,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 19:27:18,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 19:27:18,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,087 INFO L138 Inliner]: procedures = 19, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-16 19:27:18,089 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 19:27:18,090 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 19:27:18,090 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 19:27:18,090 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 19:27:18,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,140 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 19:27:18,141 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,142 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,154 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,155 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,156 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,161 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 19:27:18,162 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 19:27:18,163 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 19:27:18,163 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 19:27:18,163 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (1/1) ... [2024-11-16 19:27:18,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 19:27:18,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:27:18,203 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-16 19:27:18,205 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-16 19:27:18,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 19:27:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 19:27:18,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 19:27:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 19:27:18,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 19:27:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 19:27:18,245 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 19:27:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 19:27:18,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 19:27:18,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 19:27:18,247 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 19:27:18,326 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 19:27:18,328 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 19:27:18,510 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 19:27:18,510 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 19:27:18,625 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 19:27:18,625 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 19:27:18,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:27:18 BoogieIcfgContainer [2024-11-16 19:27:18,626 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 19:27:18,629 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 19:27:18,629 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 19:27:18,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 19:27:18,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 07:27:17" (1/3) ... [2024-11-16 19:27:18,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e722687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:27:18, skipping insertion in model container [2024-11-16 19:27:18,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 07:27:18" (2/3) ... [2024-11-16 19:27:18,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e722687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 07:27:18, skipping insertion in model container [2024-11-16 19:27:18,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:27:18" (3/3) ... [2024-11-16 19:27:18,638 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2024-11-16 19:27:18,656 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 19:27:18,656 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 19:27:18,656 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 19:27:18,703 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 19:27:18,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 46 transitions, 113 flow [2024-11-16 19:27:18,784 INFO L124 PetriNetUnfolderBase]: 6/43 cut-off events. [2024-11-16 19:27:18,784 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 19:27:18,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 43 events. 6/43 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 87 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2024-11-16 19:27:18,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 46 transitions, 113 flow [2024-11-16 19:27:18,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 46 places, 42 transitions, 102 flow [2024-11-16 19:27:18,809 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 19:27:18,818 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;@1c70a286, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 19:27:18,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-16 19:27:18,844 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 19:27:18,844 INFO L124 PetriNetUnfolderBase]: 6/41 cut-off events. [2024-11-16 19:27:18,844 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 19:27:18,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:18,845 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:27:18,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:18,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:18,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1124364006, now seen corresponding path program 1 times [2024-11-16 19:27:18,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:18,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106712578] [2024-11-16 19:27:18,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:18,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:19,154 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-16 19:27:19,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:19,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106712578] [2024-11-16 19:27:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106712578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:19,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:19,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 19:27:19,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890132034] [2024-11-16 19:27:19,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:19,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 19:27:19,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:19,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 19:27:19,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 19:27:19,200 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 46 [2024-11-16 19:27:19,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 102 flow. Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:27:19,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:19,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 46 [2024-11-16 19:27:19,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:19,341 INFO L124 PetriNetUnfolderBase]: 210/376 cut-off events. [2024-11-16 19:27:19,341 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2024-11-16 19:27:19,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 754 conditions, 376 events. 210/376 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2086 event pairs, 169 based on Foata normal form. 61/375 useless extension candidates. Maximal degree in co-relation 661. Up to 327 conditions per place. [2024-11-16 19:27:19,349 INFO L140 encePairwiseOnDemand]: 44/46 looper letters, 22 selfloop transitions, 0 changer transitions 0/40 dead transitions. [2024-11-16 19:27:19,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 142 flow [2024-11-16 19:27:19,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 19:27:19,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2024-11-16 19:27:19,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2024-11-16 19:27:19,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.717391304347826 [2024-11-16 19:27:19,366 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 102 flow. Second operand 2 states and 66 transitions. [2024-11-16 19:27:19,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 142 flow [2024-11-16 19:27:19,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 40 transitions, 130 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 19:27:19,372 INFO L231 Difference]: Finished difference. Result has 41 places, 40 transitions, 86 flow [2024-11-16 19:27:19,374 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=40} [2024-11-16 19:27:19,379 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -5 predicate places. [2024-11-16 19:27:19,380 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 40 transitions, 86 flow [2024-11-16 19:27:19,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:27:19,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:19,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:27:19,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 19:27:19,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:19,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1603092041, now seen corresponding path program 1 times [2024-11-16 19:27:19,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:19,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510065781] [2024-11-16 19:27:19,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:19,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:19,572 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-16 19:27:19,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:19,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510065781] [2024-11-16 19:27:19,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510065781] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:19,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:19,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:27:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310624380] [2024-11-16 19:27:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:19,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:27:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:19,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:27:19,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:27:19,586 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-16 19:27:19,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 40 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:27:19,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:19,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-16 19:27:19,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:19,775 INFO L124 PetriNetUnfolderBase]: 523/925 cut-off events. [2024-11-16 19:27:19,775 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 19:27:19,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1738 conditions, 925 events. 523/925 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5134 event pairs, 191 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1735. Up to 442 conditions per place. [2024-11-16 19:27:19,790 INFO L140 encePairwiseOnDemand]: 40/46 looper letters, 30 selfloop transitions, 4 changer transitions 3/51 dead transitions. [2024-11-16 19:27:19,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 183 flow [2024-11-16 19:27:19,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:27:19,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:27:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2024-11-16 19:27:19,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6521739130434783 [2024-11-16 19:27:19,793 INFO L175 Difference]: Start difference. First operand has 41 places, 40 transitions, 86 flow. Second operand 3 states and 90 transitions. [2024-11-16 19:27:19,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 183 flow [2024-11-16 19:27:19,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:27:19,797 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 114 flow [2024-11-16 19:27:19,797 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2024-11-16 19:27:19,800 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2024-11-16 19:27:19,800 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 114 flow [2024-11-16 19:27:19,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 19:27:19,801 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:19,801 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 19:27:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 19:27:19,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:19,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:19,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1176492541, now seen corresponding path program 2 times [2024-11-16 19:27:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437477038] [2024-11-16 19:27:19,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:19,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437477038] [2024-11-16 19:27:20,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437477038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:20,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:20,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:27:20,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849787952] [2024-11-16 19:27:20,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:20,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:27:20,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:27:20,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:27:20,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 46 [2024-11-16 19:27:20,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-16 19:27:20,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:20,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 46 [2024-11-16 19:27:20,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:20,375 INFO L124 PetriNetUnfolderBase]: 798/1620 cut-off events. [2024-11-16 19:27:20,376 INFO L125 PetriNetUnfolderBase]: For 277/288 co-relation queries the response was YES. [2024-11-16 19:27:20,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3078 conditions, 1620 events. 798/1620 cut-off events. For 277/288 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 10625 event pairs, 164 based on Foata normal form. 57/1440 useless extension candidates. Maximal degree in co-relation 3073. Up to 664 conditions per place. [2024-11-16 19:27:20,386 INFO L140 encePairwiseOnDemand]: 38/46 looper letters, 38 selfloop transitions, 8 changer transitions 0/64 dead transitions. [2024-11-16 19:27:20,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 64 transitions, 256 flow [2024-11-16 19:27:20,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 19:27:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-16 19:27:20,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 145 transitions. [2024-11-16 19:27:20,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6304347826086957 [2024-11-16 19:27:20,389 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 114 flow. Second operand 5 states and 145 transitions. [2024-11-16 19:27:20,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 64 transitions, 256 flow [2024-11-16 19:27:20,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 64 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:27:20,392 INFO L231 Difference]: Finished difference. Result has 50 places, 47 transitions, 163 flow [2024-11-16 19:27:20,393 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=163, PETRI_PLACES=50, PETRI_TRANSITIONS=47} [2024-11-16 19:27:20,393 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 4 predicate places. [2024-11-16 19:27:20,393 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 47 transitions, 163 flow [2024-11-16 19:27:20,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 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-16 19:27:20,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:20,394 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-16 19:27:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 19:27:20,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:20,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -227981696, now seen corresponding path program 1 times [2024-11-16 19:27:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352300344] [2024-11-16 19:27:20,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:20,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:20,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:20,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:20,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352300344] [2024-11-16 19:27:20,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352300344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:20,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:20,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:27:20,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94341700] [2024-11-16 19:27:20,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:20,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:27:20,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:20,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:27:20,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:27:20,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-16 19:27:20,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 47 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-16 19:27:20,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:20,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-16 19:27:20,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:20,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][50], [60#true, 69#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 29#L71true, 28#L55true, 53#true, Black: 55#true]) [2024-11-16 19:27:20,734 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,734 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,734 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,734 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,737 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][34], [60#true, 69#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 41#L43true, 28#L55true, 53#true, Black: 55#true]) [2024-11-16 19:27:20,737 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,737 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,737 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,737 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,744 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([228] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][19], [60#true, 69#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 16#L56true, 35#L42true, 53#true, Black: 55#true]) [2024-11-16 19:27:20,744 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,744 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,744 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,744 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,745 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][34], [60#true, 69#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 28#L55true, 41#L43true, 53#true, Black: 55#true, 19#thread3EXITtrue]) [2024-11-16 19:27:20,745 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,746 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,746 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,746 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,746 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][50], [69#true, 60#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 37#L46true, 28#L55true, 53#true, Black: 55#true, 19#thread3EXITtrue]) [2024-11-16 19:27:20,746 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,746 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,746 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,747 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][50], [69#true, 60#true, 4#L89true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 29#L71true, 28#L55true, 53#true, Black: 55#true]) [2024-11-16 19:27:20,753 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,753 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,753 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,753 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,756 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][34], [69#true, 60#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 41#L43true, 28#L55true, 53#true, Black: 55#true]) [2024-11-16 19:27:20,756 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,757 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,757 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,757 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([228] L55-1-->L56: Formula: (not (= (mod v_~v_assert~0_4 256) 0)) InVars {~v_assert~0=v_~v_assert~0_4} OutVars{~v_assert~0=v_~v_assert~0_4} AuxVars[] AssignedVars[][19], [60#true, 69#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 16#L56true, 35#L42true, 53#true, Black: 55#true]) [2024-11-16 19:27:20,764 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,765 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,765 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,765 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][34], [69#true, 60#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 28#L55true, 41#L43true, 53#true, Black: 55#true, 19#thread3EXITtrue]) [2024-11-16 19:27:20,766 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-16 19:27:20,766 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-16 19:27:20,766 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-16 19:27:20,767 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][50], [69#true, 60#true, 4#L89true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 28#L55true, 53#true, Black: 55#true, 19#thread3EXITtrue]) [2024-11-16 19:27:20,767 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2024-11-16 19:27:20,767 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-16 19:27:20,767 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-11-16 19:27:20,767 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,776 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][38], [60#true, 4#L89true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 29#L71true, 53#true, Black: 55#true, 71#(<= 1 (mod ~d2~0 256)), 10#L57-1true]) [2024-11-16 19:27:20,777 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,777 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,777 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,777 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,777 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][38], [60#true, 4#L89true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 53#true, Black: 55#true, 71#(<= 1 (mod ~d2~0 256)), 19#thread3EXITtrue, 10#L57-1true]) [2024-11-16 19:27:20,777 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,778 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,778 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,778 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,778 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][38], [60#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 29#L71true, 53#true, Black: 55#true, 43#L62true, 71#(<= 1 (mod ~d2~0 256))]) [2024-11-16 19:27:20,778 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,778 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,778 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,779 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][38], [60#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 53#true, 71#(<= 1 (mod ~d2~0 256)), Black: 55#true, 43#L62true, 19#thread3EXITtrue]) [2024-11-16 19:27:20,779 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,779 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,779 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,780 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][18], [60#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 41#L43true, 53#true, Black: 55#true, 71#(<= 1 (mod ~d2~0 256)), 10#L57-1true]) [2024-11-16 19:27:20,785 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][18], [60#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 41#L43true, 53#true, Black: 55#true, 71#(<= 1 (mod ~d2~0 256)), 19#thread3EXITtrue, 10#L57-1true]) [2024-11-16 19:27:20,785 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,785 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][18], [60#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 41#L43true, 53#true, Black: 55#true, 43#L62true, 71#(<= 1 (mod ~d2~0 256))]) [2024-11-16 19:27:20,786 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][18], [60#true, 27#L88-1true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 41#L43true, 53#true, Black: 55#true, 43#L62true, 19#thread3EXITtrue, 71#(<= 1 (mod ~d2~0 256))]) [2024-11-16 19:27:20,786 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,786 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,788 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,801 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][38], [60#true, 4#L89true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 29#L71true, 53#true, Black: 55#true, 71#(<= 1 (mod ~d2~0 256)), 43#L62true]) [2024-11-16 19:27:20,802 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,802 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,802 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,802 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([220] L46-3-->L46: Formula: (and (= |v_thread1Thread1of1ForFork2_#t~post2_1| (+ v_~pos~0_15 1)) (= |v_thread1Thread1of1ForFork2_#t~post2_1| v_~pos~0_16)) InVars {~pos~0=v_~pos~0_16} OutVars{thread1Thread1of1ForFork2_#t~post2=|v_thread1Thread1of1ForFork2_#t~post2_1|, ~pos~0=v_~pos~0_15} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post2, ~pos~0][38], [60#true, 4#L89true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), 37#L46true, Black: 62#(<= 0 ~pos~0), 53#true, Black: 55#true, 71#(<= 1 (mod ~d2~0 256)), 43#L62true, 19#thread3EXITtrue]) [2024-11-16 19:27:20,802 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,802 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,803 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,803 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,803 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][18], [60#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 29#L71true, 41#L43true, 53#true, Black: 55#true, 43#L62true, 71#(<= 1 (mod ~d2~0 256))]) [2024-11-16 19:27:20,804 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,804 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,804 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-11-16 19:27:20,804 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-11-16 19:27:20,804 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([219] L43-3-->L43: Formula: (and (= (+ |v_thread1Thread1of1ForFork2_#t~post1_1| 1) v_~pos~0_21) (= |v_thread1Thread1of1ForFork2_#t~post1_1| v_~pos~0_22)) InVars {~pos~0=v_~pos~0_22} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_1|, ~pos~0=v_~pos~0_21} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][18], [60#true, Black: 65#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0) (<= 0 ~pos~0)), 4#L89true, Black: 63#(and (<= 1 ~v_assert~0) (<= (div ~v_assert~0 256) 0)), Black: 62#(<= 0 ~pos~0), 41#L43true, 53#true, Black: 55#true, 43#L62true, 19#thread3EXITtrue, 71#(<= 1 (mod ~d2~0 256))]) [2024-11-16 19:27:20,804 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,804 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,805 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-11-16 19:27:20,805 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-11-16 19:27:20,815 INFO L124 PetriNetUnfolderBase]: 1900/3256 cut-off events. [2024-11-16 19:27:20,815 INFO L125 PetriNetUnfolderBase]: For 1876/2057 co-relation queries the response was YES. [2024-11-16 19:27:20,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7516 conditions, 3256 events. 1900/3256 cut-off events. For 1876/2057 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 20744 event pairs, 739 based on Foata normal form. 1/2523 useless extension candidates. Maximal degree in co-relation 7508. Up to 1270 conditions per place. [2024-11-16 19:27:20,888 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 44 selfloop transitions, 3 changer transitions 0/64 dead transitions. [2024-11-16 19:27:20,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 316 flow [2024-11-16 19:27:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:27:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:27:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 94 transitions. [2024-11-16 19:27:20,889 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6811594202898551 [2024-11-16 19:27:20,889 INFO L175 Difference]: Start difference. First operand has 50 places, 47 transitions, 163 flow. Second operand 3 states and 94 transitions. [2024-11-16 19:27:20,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 316 flow [2024-11-16 19:27:20,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 310 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 19:27:20,896 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 180 flow [2024-11-16 19:27:20,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2024-11-16 19:27:20,898 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 7 predicate places. [2024-11-16 19:27:20,899 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 180 flow [2024-11-16 19:27:20,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-16 19:27:20,899 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:20,899 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 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-16 19:27:20,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 19:27:20,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:20,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1039966129, now seen corresponding path program 1 times [2024-11-16 19:27:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750779791] [2024-11-16 19:27:20,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:20,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:20,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750779791] [2024-11-16 19:27:20,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750779791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:20,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:20,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 19:27:20,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912878792] [2024-11-16 19:27:20,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:20,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 19:27:20,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:20,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 19:27:20,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 19:27:20,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-16 19:27:20,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-16 19:27:20,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:20,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-16 19:27:20,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:21,343 INFO L124 PetriNetUnfolderBase]: 2222/3982 cut-off events. [2024-11-16 19:27:21,343 INFO L125 PetriNetUnfolderBase]: For 1988/2072 co-relation queries the response was YES. [2024-11-16 19:27:21,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9148 conditions, 3982 events. 2222/3982 cut-off events. For 1988/2072 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 26842 event pairs, 911 based on Foata normal form. 1/3393 useless extension candidates. Maximal degree in co-relation 9139. Up to 1622 conditions per place. [2024-11-16 19:27:21,438 INFO L140 encePairwiseOnDemand]: 42/46 looper letters, 44 selfloop transitions, 3 changer transitions 2/68 dead transitions. [2024-11-16 19:27:21,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 341 flow [2024-11-16 19:27:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 19:27:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 19:27:21,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 96 transitions. [2024-11-16 19:27:21,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2024-11-16 19:27:21,441 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 180 flow. Second operand 3 states and 96 transitions. [2024-11-16 19:27:21,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 341 flow [2024-11-16 19:27:21,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:27:21,451 INFO L231 Difference]: Finished difference. Result has 55 places, 50 transitions, 190 flow [2024-11-16 19:27:21,451 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=55, PETRI_TRANSITIONS=50} [2024-11-16 19:27:21,452 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 9 predicate places. [2024-11-16 19:27:21,454 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 50 transitions, 190 flow [2024-11-16 19:27:21,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 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-16 19:27:21,454 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:21,454 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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-16 19:27:21,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 19:27:21,455 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:21,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:21,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1441044589, now seen corresponding path program 1 times [2024-11-16 19:27:21,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:21,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790319739] [2024-11-16 19:27:21,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:21,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:21,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-16 19:27:21,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790319739] [2024-11-16 19:27:21,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790319739] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:27:21,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111617661] [2024-11-16 19:27:21,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:21,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:27:21,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:27:21,637 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:27:21,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 19:27:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:21,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-16 19:27:21,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:27:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:21,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:27:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:21,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111617661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:27:21,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:27:21,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-16 19:27:21,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879331152] [2024-11-16 19:27:21,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:27:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:27:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:21,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:27:21,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:27:22,002 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-16 19:27:22,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 50 transitions, 190 flow. Second operand has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 11 states have internal predecessors, (227), 0 states have call successors, (0), 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-16 19:27:22,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:22,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-16 19:27:22,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:22,900 INFO L124 PetriNetUnfolderBase]: 3414/6698 cut-off events. [2024-11-16 19:27:22,900 INFO L125 PetriNetUnfolderBase]: For 4861/4883 co-relation queries the response was YES. [2024-11-16 19:27:22,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16362 conditions, 6698 events. 3414/6698 cut-off events. For 4861/4883 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 50820 event pairs, 316 based on Foata normal form. 160/6588 useless extension candidates. Maximal degree in co-relation 16352. Up to 1395 conditions per place. [2024-11-16 19:27:22,941 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 59 selfloop transitions, 20 changer transitions 26/123 dead transitions. [2024-11-16 19:27:22,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 123 transitions, 657 flow [2024-11-16 19:27:22,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:27:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:27:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2024-11-16 19:27:22,944 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-16 19:27:22,944 INFO L175 Difference]: Start difference. First operand has 55 places, 50 transitions, 190 flow. Second operand 9 states and 249 transitions. [2024-11-16 19:27:22,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 123 transitions, 657 flow [2024-11-16 19:27:22,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 123 transitions, 651 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 19:27:22,955 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 367 flow [2024-11-16 19:27:22,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=367, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2024-11-16 19:27:22,957 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 21 predicate places. [2024-11-16 19:27:22,957 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 367 flow [2024-11-16 19:27:22,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.636363636363637) internal successors, (227), 11 states have internal predecessors, (227), 0 states have call successors, (0), 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-16 19:27:22,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:22,958 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 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-16 19:27:22,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-16 19:27:23,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-16 19:27:23,159 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:23,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:23,160 INFO L85 PathProgramCache]: Analyzing trace with hash 2101240458, now seen corresponding path program 1 times [2024-11-16 19:27:23,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:23,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583694683] [2024-11-16 19:27:23,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:23,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:23,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:23,377 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:23,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583694683] [2024-11-16 19:27:23,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583694683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:27:23,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775535279] [2024-11-16 19:27:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:23,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:27:23,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:27:23,383 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:27:23,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 19:27:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:23,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 19:27:23,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:27:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:23,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:27:23,685 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:23,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775535279] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:27:23,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:27:23,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 6] total 11 [2024-11-16 19:27:23,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135925856] [2024-11-16 19:27:23,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:27:23,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 19:27:23,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:23,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 19:27:23,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 19:27:23,696 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 46 [2024-11-16 19:27:23,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 367 flow. Second operand has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 11 states have internal predecessors, (228), 0 states have call successors, (0), 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-16 19:27:23,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:23,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 46 [2024-11-16 19:27:23,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:24,619 INFO L124 PetriNetUnfolderBase]: 4417/9249 cut-off events. [2024-11-16 19:27:24,619 INFO L125 PetriNetUnfolderBase]: For 20532/20632 co-relation queries the response was YES. [2024-11-16 19:27:24,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27395 conditions, 9249 events. 4417/9249 cut-off events. For 20532/20632 co-relation queries the response was YES. Maximal size of possible extension queue 422. Compared 76665 event pairs, 268 based on Foata normal form. 176/8851 useless extension candidates. Maximal degree in co-relation 27379. Up to 2240 conditions per place. [2024-11-16 19:27:24,673 INFO L140 encePairwiseOnDemand]: 34/46 looper letters, 76 selfloop transitions, 30 changer transitions 30/154 dead transitions. [2024-11-16 19:27:24,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 154 transitions, 1155 flow [2024-11-16 19:27:24,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:27:24,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:27:24,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 249 transitions. [2024-11-16 19:27:24,675 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6014492753623188 [2024-11-16 19:27:24,675 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 367 flow. Second operand 9 states and 249 transitions. [2024-11-16 19:27:24,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 154 transitions, 1155 flow [2024-11-16 19:27:24,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 154 transitions, 1030 flow, removed 61 selfloop flow, removed 3 redundant places. [2024-11-16 19:27:24,717 INFO L231 Difference]: Finished difference. Result has 75 places, 82 transitions, 600 flow [2024-11-16 19:27:24,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=600, PETRI_PLACES=75, PETRI_TRANSITIONS=82} [2024-11-16 19:27:24,718 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2024-11-16 19:27:24,718 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 82 transitions, 600 flow [2024-11-16 19:27:24,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 20.727272727272727) internal successors, (228), 11 states have internal predecessors, (228), 0 states have call successors, (0), 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-16 19:27:24,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:24,719 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 2, 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-16 19:27:24,737 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 19:27:24,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-16 19:27:24,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:24,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash 842461700, now seen corresponding path program 2 times [2024-11-16 19:27:24,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048880095] [2024-11-16 19:27:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:25,040 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:27:25,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:25,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048880095] [2024-11-16 19:27:25,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048880095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:25,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:25,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:27:25,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613981994] [2024-11-16 19:27:25,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:25,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:27:25,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:25,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:27:25,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:27:25,049 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-16 19:27:25,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 600 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:27:25,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:25,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-16 19:27:25,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:26,263 INFO L124 PetriNetUnfolderBase]: 5566/10687 cut-off events. [2024-11-16 19:27:26,264 INFO L125 PetriNetUnfolderBase]: For 30422/32290 co-relation queries the response was YES. [2024-11-16 19:27:26,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34704 conditions, 10687 events. 5566/10687 cut-off events. For 30422/32290 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 85854 event pairs, 1895 based on Foata normal form. 228/9120 useless extension candidates. Maximal degree in co-relation 34684. Up to 3164 conditions per place. [2024-11-16 19:27:26,351 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 104 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2024-11-16 19:27:26,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 134 transitions, 1174 flow [2024-11-16 19:27:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:27:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:27:26,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2024-11-16 19:27:26,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6956521739130435 [2024-11-16 19:27:26,354 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 600 flow. Second operand 4 states and 128 transitions. [2024-11-16 19:27:26,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 134 transitions, 1174 flow [2024-11-16 19:27:26,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 134 transitions, 1128 flow, removed 12 selfloop flow, removed 6 redundant places. [2024-11-16 19:27:26,395 INFO L231 Difference]: Finished difference. Result has 75 places, 84 transitions, 604 flow [2024-11-16 19:27:26,396 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=604, PETRI_PLACES=75, PETRI_TRANSITIONS=84} [2024-11-16 19:27:26,396 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2024-11-16 19:27:26,396 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 84 transitions, 604 flow [2024-11-16 19:27:26,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:27:26,397 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:26,397 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 2, 2, 2, 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-16 19:27:26,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 19:27:26,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:26,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 541148036, now seen corresponding path program 2 times [2024-11-16 19:27:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042178598] [2024-11-16 19:27:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:26,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 19:27:26,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:26,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042178598] [2024-11-16 19:27:26,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042178598] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 19:27:26,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 19:27:26,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 19:27:26,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946031916] [2024-11-16 19:27:26,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 19:27:26,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 19:27:26,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:26,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 19:27:26,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 19:27:26,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 46 [2024-11-16 19:27:26,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 84 transitions, 604 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:27:26,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:26,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 46 [2024-11-16 19:27:26,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:27,512 INFO L124 PetriNetUnfolderBase]: 5135/10371 cut-off events. [2024-11-16 19:27:27,512 INFO L125 PetriNetUnfolderBase]: For 30158/31339 co-relation queries the response was YES. [2024-11-16 19:27:27,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34464 conditions, 10371 events. 5135/10371 cut-off events. For 30158/31339 co-relation queries the response was YES. Maximal size of possible extension queue 392. Compared 84084 event pairs, 1435 based on Foata normal form. 129/9573 useless extension candidates. Maximal degree in co-relation 34444. Up to 3132 conditions per place. [2024-11-16 19:27:27,674 INFO L140 encePairwiseOnDemand]: 41/46 looper letters, 91 selfloop transitions, 5 changer transitions 10/130 dead transitions. [2024-11-16 19:27:27,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 130 transitions, 1117 flow [2024-11-16 19:27:27,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 19:27:27,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 19:27:27,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2024-11-16 19:27:27,676 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6902173913043478 [2024-11-16 19:27:27,676 INFO L175 Difference]: Start difference. First operand has 75 places, 84 transitions, 604 flow. Second operand 4 states and 127 transitions. [2024-11-16 19:27:27,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 130 transitions, 1117 flow [2024-11-16 19:27:27,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 130 transitions, 1117 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 19:27:27,703 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 592 flow [2024-11-16 19:27:27,704 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=592, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2024-11-16 19:27:27,704 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 35 predicate places. [2024-11-16 19:27:27,705 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 592 flow [2024-11-16 19:27:27,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 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-16 19:27:27,705 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:27,705 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 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-16 19:27:27,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 19:27:27,706 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:27,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:27,706 INFO L85 PathProgramCache]: Analyzing trace with hash -168374142, now seen corresponding path program 1 times [2024-11-16 19:27:27,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:27,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566417269] [2024-11-16 19:27:27,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:27,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:27,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566417269] [2024-11-16 19:27:27,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566417269] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:27:27,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229451704] [2024-11-16 19:27:27,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:27,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:27:27,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:27:27,868 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:27:27,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 19:27:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:27,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 19:27:27,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:27:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:28,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:27:28,183 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:28,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229451704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:27:28,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:27:28,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 7] total 12 [2024-11-16 19:27:28,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149543606] [2024-11-16 19:27:28,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:27:28,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:27:28,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:28,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:27:28,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:27:28,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 46 [2024-11-16 19:27:28,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 592 flow. Second operand has 12 states, 12 states have (on average 18.583333333333332) internal successors, (223), 12 states have internal predecessors, (223), 0 states have call successors, (0), 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-16 19:27:28,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:28,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 46 [2024-11-16 19:27:28,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:31,277 INFO L124 PetriNetUnfolderBase]: 12945/24884 cut-off events. [2024-11-16 19:27:31,278 INFO L125 PetriNetUnfolderBase]: For 79199/79283 co-relation queries the response was YES. [2024-11-16 19:27:31,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 88129 conditions, 24884 events. 12945/24884 cut-off events. For 79199/79283 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 217775 event pairs, 1243 based on Foata normal form. 312/25073 useless extension candidates. Maximal degree in co-relation 88106. Up to 5770 conditions per place. [2024-11-16 19:27:31,431 INFO L140 encePairwiseOnDemand]: 33/46 looper letters, 101 selfloop transitions, 56 changer transitions 161/333 dead transitions. [2024-11-16 19:27:31,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 333 transitions, 3100 flow [2024-11-16 19:27:31,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 19:27:31,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-16 19:27:31,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 391 transitions. [2024-11-16 19:27:31,434 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.53125 [2024-11-16 19:27:31,434 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 592 flow. Second operand 16 states and 391 transitions. [2024-11-16 19:27:31,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 333 transitions, 3100 flow [2024-11-16 19:27:31,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 333 transitions, 3072 flow, removed 14 selfloop flow, removed 0 redundant places. [2024-11-16 19:27:31,518 INFO L231 Difference]: Finished difference. Result has 106 places, 112 transitions, 1133 flow [2024-11-16 19:27:31,519 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1133, PETRI_PLACES=106, PETRI_TRANSITIONS=112} [2024-11-16 19:27:31,520 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 60 predicate places. [2024-11-16 19:27:31,520 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 112 transitions, 1133 flow [2024-11-16 19:27:31,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 18.583333333333332) internal successors, (223), 12 states have internal predecessors, (223), 0 states have call successors, (0), 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-16 19:27:31,520 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 19:27:31,520 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 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-16 19:27:31,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 19:27:31,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:27:31,722 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2024-11-16 19:27:31,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 19:27:31,722 INFO L85 PathProgramCache]: Analyzing trace with hash -50242120, now seen corresponding path program 2 times [2024-11-16 19:27:31,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 19:27:31,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491981107] [2024-11-16 19:27:31,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 19:27:31,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 19:27:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 19:27:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:31,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 19:27:31,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491981107] [2024-11-16 19:27:31,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491981107] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 19:27:31,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107248350] [2024-11-16 19:27:31,941 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 19:27:31,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:27:31,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 19:27:31,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 19:27:31,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-16 19:27:32,020 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 19:27:32,020 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 19:27:32,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 19:27:32,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 19:27:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:32,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 19:27:32,260 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 19:27:32,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107248350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 19:27:32,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 19:27:32,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 7] total 12 [2024-11-16 19:27:32,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965188425] [2024-11-16 19:27:32,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 19:27:32,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 19:27:32,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 19:27:32,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 19:27:32,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-16 19:27:32,300 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 46 [2024-11-16 19:27:32,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 112 transitions, 1133 flow. Second operand has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 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-16 19:27:32,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 19:27:32,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 46 [2024-11-16 19:27:32,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 19:27:33,520 INFO L124 PetriNetUnfolderBase]: 4065/8855 cut-off events. [2024-11-16 19:27:33,520 INFO L125 PetriNetUnfolderBase]: For 56383/56427 co-relation queries the response was YES. [2024-11-16 19:27:33,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35417 conditions, 8855 events. 4065/8855 cut-off events. For 56383/56427 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 74085 event pairs, 281 based on Foata normal form. 316/9143 useless extension candidates. Maximal degree in co-relation 35383. Up to 2700 conditions per place. [2024-11-16 19:27:33,553 INFO L140 encePairwiseOnDemand]: 37/46 looper letters, 0 selfloop transitions, 0 changer transitions 190/190 dead transitions. [2024-11-16 19:27:33,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 190 transitions, 2146 flow [2024-11-16 19:27:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 19:27:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 19:27:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 220 transitions. [2024-11-16 19:27:33,554 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5314009661835749 [2024-11-16 19:27:33,554 INFO L175 Difference]: Start difference. First operand has 106 places, 112 transitions, 1133 flow. Second operand 9 states and 220 transitions. [2024-11-16 19:27:33,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 190 transitions, 2146 flow [2024-11-16 19:27:33,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 190 transitions, 1893 flow, removed 56 selfloop flow, removed 14 redundant places. [2024-11-16 19:27:33,631 INFO L231 Difference]: Finished difference. Result has 87 places, 0 transitions, 0 flow [2024-11-16 19:27:33,631 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=46, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=0, PETRI_PLACES=87, PETRI_TRANSITIONS=0} [2024-11-16 19:27:33,632 INFO L277 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2024-11-16 19:27:33,632 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 0 transitions, 0 flow [2024-11-16 19:27:33,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 20.166666666666668) internal successors, (242), 12 states have internal predecessors, (242), 0 states have call successors, (0), 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-16 19:27:33,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2024-11-16 19:27:33,635 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2024-11-16 19:27:33,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2024-11-16 19:27:33,636 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2024-11-16 19:27:33,653 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-16 19:27:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 19:27:33,841 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1] [2024-11-16 19:27:33,844 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 19:27:33,844 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 19:27:33,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 07:27:33 BasicIcfg [2024-11-16 19:27:33,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 19:27:33,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 19:27:33,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 19:27:33,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 19:27:33,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 07:27:18" (3/4) ... [2024-11-16 19:27:33,853 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 19:27:33,856 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 19:27:33,857 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 19:27:33,858 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-16 19:27:33,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-11-16 19:27:33,861 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2024-11-16 19:27:33,862 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 19:27:33,862 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 19:27:33,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 19:27:33,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 19:27:33,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 19:27:33,940 INFO L158 Benchmark]: Toolchain (without parser) took 16209.44ms. Allocated memory was 184.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 127.9MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 538.7MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,940 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 19:27:33,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 325.57ms. Allocated memory is still 184.5MB. Free memory was 127.6MB in the beginning and 114.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.28ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,941 INFO L158 Benchmark]: Boogie Preprocessor took 71.78ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,941 INFO L158 Benchmark]: IcfgBuilder took 463.75ms. Allocated memory is still 184.5MB. Free memory was 110.5MB in the beginning and 88.4MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,942 INFO L158 Benchmark]: TraceAbstraction took 15220.50ms. Allocated memory was 184.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 87.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 664.5MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,942 INFO L158 Benchmark]: Witness Printer took 89.67ms. Allocated memory is still 2.8GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 19:27:33,943 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.30ms. Allocated memory is still 184.5MB. Free memory is still 150.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 325.57ms. Allocated memory is still 184.5MB. Free memory was 127.6MB in the beginning and 114.3MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.28ms. Allocated memory is still 184.5MB. Free memory was 114.3MB in the beginning and 112.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.78ms. Allocated memory is still 184.5MB. Free memory was 112.6MB in the beginning and 110.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 463.75ms. Allocated memory is still 184.5MB. Free memory was 110.5MB in the beginning and 88.4MB in the end (delta: 22.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 15220.50ms. Allocated memory was 184.5MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 87.8MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 664.5MB. Max. memory is 16.1GB. * Witness Printer took 89.67ms. Allocated memory is still 2.8GB. Free memory was 2.2GB in the beginning and 2.2GB 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: 93]: 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 7 procedures, 68 locations, 4 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: 15.1s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 787 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 760 mSDsluCounter, 107 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 85 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1461 IncrementalHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 22 mSDtfsCounter, 1461 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 418 GetRequests, 327 SyntacticMatches, 16 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1133occurred in iteration=10, InterpolantAutomatonStates: 67, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 564 NumberOfCodeBlocks, 564 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 715 ConstructedInterpolants, 0 QuantifiedInterpolants, 1923 SizeOfPredicates, 25 NumberOfNonLiveVariables, 664 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 19 InterpolantComputations, 7 PerfectInterpolantSequences, 106/187 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 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 19:27:33,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE